Abstract
We show that it is undecidable whether or not two finite substitutions are equivalent on the fixed regular language ab * c. This gives an unexpected answer to a question proposed in 1985 by Culik II and Karhumäki. At the same time it can be seen as the final result in a series of undecidability results for finite transducers initiated in 1968 by Griffiths. An application to systems of equations over finite languages is given.© 2002 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Karhumäki, J., & Lisovik, L. P. (2002). The equivalence problem of finite substitutions on ab*c, with applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2380 LNCS, pp. 812–820). Springer Verlag. https://doi.org/10.1007/3-540-45465-9_69
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
