Equivalence of finite-valued streaming string transducers is decidable
classification
💻 cs.FL
keywords
decidableequivalencefinite-valuedstreamingstringtransducersaluranswer
read the original abstract
In this paper we provide a positive answer to a question left open by Alur and and Deshmukh in 2011 by showing that equivalence of finite-valued copyless streaming string transducers is decidable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.