A simple undecidable problem: The inclusion problem for finite substitutions on ab*C

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2010, Issue , 2001, Pages 388-395

  Karhumäki, Juhani ^a   Lisovik, Leonid P ^b  

^a UNIVERSITY OF TURKU   (Finland)

^b TARAS SHEVCHENKO NATIONAL UNIVERSITY OF KYIV   (Ukraine)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

INCLUSION PROBLEM;

ARTIFICIAL INTELLIGENCE;

EID: 84892731160     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_34     Document Type: Conference Paper

References (16)

1. Berstel, J. Transductions and Context-Free Languages, B.G. Teubner, Stuttgart, 1979.
2. Conway, J. Regular Algebra and Finite Machines, Chapman and Hall Ltd, London 1971.
3. Choffrut, C. and Karhumäki, J., Combinatorics of words, in: A. Salomaa and G. Rozenberg (eds), Handbook of Formal Languages, Springer 1997, 324-438.
4. Culik, K, II and Karhumäki, J., Decision problems solved with the help of Ehrenfeucht Conjecture, EATCS Bulletin 27, 1985, 30-35.
5. 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.
6. Halava, V. and Harju, T., Undecidability of the equivalence of finite substitu- tions on regular languages, Theoret. Inform. and Appl. 33, 1999, 117-124.
7. Karhumäki, J., On the equivalence problem for binary D0L systems, Information and Control 50, 276-284, 1981.
8. 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.
9. 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.
10. Lisovik, L. P. An undecidable problem for countable Markov chains, Kibernetika 2, 1991, 1-6.
11. Lisovik, L. P. The equivalence problem for finite substitutions on regular lan- guages, Doklady of Academy of Sciences of Russia 357, 1997, 299-301.
12. Lisovik, L. P. The equivalence problems for transducers with restricted number of states, Kibernetika i Sistemny Analiz 6, 1997, 109-114.
13. Maon, Y., On the equivalence of some transductions involving letter to letter morphisms on regular languages, Acta inform. 23, 1986, 585-596.
14. Rozenberg, G. and Salomaa, A., The Mathematical Theory of L Systems, Academic Press, 1980.
15. Turakainen, P., On some transducer equivalence problems for families of lan- guages, Intern. J. Computer Math. 23, 1988, 99-124.
16. Turakainen, P., The Undecidability of some equivalence problems concerning ngsm's and finite substitutions, Theoret. Comput. Sci. 174, 1997, 269-274.