Abstract
As an evidence of the power of finite unary substitutions we show that the inclusion problem for finite substitutions on the language L = ab * c is undecidable, i.e. it is undecidable whether for two finite substitutions φ and ψ the relation φ(ω) ⊑ (ω) holds for all ω in L.
Research supported under the grant 44087 of the Academy of Finland.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berstel, J. Transductions and Context-Free Languages, B.G. Teubner, Stuttgart, 1979.
Conway, J. Regular Algebra and Finite Machines, Chapman and Hall Ltd, London 1971.
Choffrut, C. and Karhumäki, J., Combinatorics of words, in: A. Salomaa and G. Rozenberg (eds), Handbook of Formal Languages, Springer 1997, 324–438.
Culik II, K. and Karhumäki, J., Decision problems solved with the help of Ehrenfeucht Conjecture, EATCS Bulletin 27, 1985, 30–35.
Choffrut, C., Karhumäki, J., and Ollinger, N., The commutation of finite sets: a challenging problem, TUCS Report 303, 1999; Special Issue of Theoret. Comput. Sci on Words, to appear.
Halava, V. and Harju, T., Undecidability of the equivalence of finite substitu-tions on regular languages, Theoret. Inform. and Appl. 33, 1999, 117–124.
Karhumäki, J., On the equivalence problem for binary D0L systems, Information and Control 50, 276–284, 1981.
Karhumäki, J. and Lisovik, L.P., On the equivalence of finite substitutions and transducers, in: J. Karhumäki, H. Maurer, Gh. Păun and G. Rozenberg (eds), Jewels are Forever, Springer, 1999, 97–108.
Karhumäki, J. and Petre, I., On the centralizer of a finite set, Proceedings of ICALP00, Lecture Notes in Computer Science 1853, Springer, 2000, 536–546.
Lisovik, L. P. An undecidable problem for countable Markov chains, Kibernetika 2, 1991, 1–6.
Lisovik, L. P. The equivalence problem for finite substitutions on regular lan-guages, Doklady of Academy of Sciences of Russia 357, 1997, 299–301.
Lisovik, L. P. The equivalence problems for transducers with restricted number of states, Kibernetika i Sistemny Analiz 6, 1997, 109–114.
Maon, Y., On the equivalence of some transductions involving letter to letter morphisms on regular languages, Acta inform. 23, 1986, 585–596
Rozenberg, G. and Salomaa, A., The Mathematical Theory of L Systems, Academic Press, 1980.
Turakainen, P., On some transducer equivalence problems for families of lan-guages, Intern. J. Computer Math. 23, 1988, 99–124.
Turakainen, P., The Undecidability of some equivalence problems concerning ngsm’s and finite substitutions, Theoret. Comput. Sci. 174, 1997, 269–274.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karhumäki, J., Lisovik, L.P. (2001). A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c. In: Ferreira, A., Reichel, H. (eds) STACS 2001. STACS 2001. Lecture Notes in Computer Science, vol 2010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44693-1_34
Download citation
DOI: https://doi.org/10.1007/3-540-44693-1_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41695-1
Online ISBN: 978-3-540-44693-4
eBook Packages: Springer Book Archive