The equivalence problem of finite substitutions on ab*c, with applications

International Journal of Foundations of Computer Science

Volumn 14, Issue 4, 2003, Pages 699-710

  Karhumaki J ^a   Lisovik, L P ^b  

^a UNIVERSITY OF TURKU   (Finland)

^b TARAS SHEVCHENKO NATIONAL UNIVERSITY OF KYIV   (Ukraine)

Author keywords

equivalence problems; finite automata; Finite languages; undecidability

Indexed keywords

EID: 20344370333     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103001960     Document Type: Article

References (31)

1. Albert, M. H. and Lawrence, J., A proof for Ehrenfeucht's Conjecture, Theoret.Comput. Sci. 41, 1985, 121-123
2. Berstel, J., Transductions and Context-Free Languages, Teubner, 1979
3. Bird, M., The equivalence problem for deterministic two-tape automata, J. Comput.Syst. Sciences 7, 1973, 218-236
4. Culik II, K. and Karhumaki, J., Systems of equations and Ehrenfeucht's conjecture,Discr. Math. 43, 1983, 139-153
5. Culik II, K. and Karhumaki, J., The equivalence problem of finite valued transducers(on HDTOL languages) is decidable, Theoret. Comput. Sci. 47, 1986, 71-84
6. Greibach, S. A., Remarks on blind and partially blind one-way multicounter machines,Theoret. Comput. Sci. 7, 1978, 311-324
7. Griffiths, T. V., The unsolvability of the equivalence problem for A-free nondeterministicgeneralized machines, J. Assoc. Comput. Mach. 15, 1968, 409-413
8. Gurari, E. and Ibarra, O., A note on finite-valued and finitely ambiguous transducers,Math. Syst. Theory 16, 1983, 61-66
9. Guba, V. S., The equivalence of infinite systems of equations in free groups andsemigroups with finite systems (in Russian), Mat. Zametki, 40, 1986, 321-324
10. Halava, V. and Harju, T., Undecidability of the equivalence of finite substitutionson regular language, Theoret. Informat. and Appl. 33, 1999, 117-124
11. Harju, T. and Karhumaki, J., The equivalence problem of multitape finite automata,Theoret. Comput. Sci. 78, 1991, 345-353
12. Harju, T. and Karhumaki, J., Morphisms, in: G. Rozenberg and A. Salomaa (eds),Handbook of Formal Languages, Vol. I, Springer, 1997, 439-510
13. Ibarra, O., The unsolvability of the equivalence problem for £-free NGSM's withunary input (output) alphabet and applications, SI AM J. Comput. 7, 1978, 524-532
14. Karhumaki, J., Problem P 97, Bull. EATCS 25, 1985, 185
15. Karhumaki, J., Challenges of commutation: an advertisement, Springer LNCS 2138,2001, 15-23
16. Karhumaki, J., Equations over finite sets of words and equivalence problems inautomata theory, Theoret. Comput. Sci. 108, 1993, 103-118
17. Karhumaki, J., Some open problems in combinatorics of words and related areas,RIMS Prodeedings 1166, Research Institute of Mathematical Sciences, Kyoto, 2000,118-130
18. Karhumaki, J. and Lisovik, L. P., On the equivalence of finite substitutions andtransducers, in: J. Karhumaki, H. Maurer, Gh. Paun and G. Rozenberg (eds), Jewelsare Forever, Springer, 1999, 97-108
19. Karhumaki, J. and Lisovik, L. P., A simple undecidable problem: The inclusionproblem for finite substitutions on abc, Inf. and Comput. (to appear); preliminaryversion in Springer LNCS 2010, 2001, 388-395
20. Karhumaki, J. and Lisovik, L. P., The equivalence problem of finite substitutionson ab*c, with applications, Springer LNCS 2380, 2002, 812-820
21. Lawrence, J., The nonexistence of finite test set for set-equivalence of finite substitutions,Bull. EATCS 28, 1986, 34-37
22. Lisovik, L. P., The identity problem of regular events over cartesian product of freeand cyclic semigroups, Doklady of Academy of Sciences of Ukraine 6, 1979, 410-413
23. Lisovik, L. P., An undecidability problem for countable Markov chains, Kibernetika2, 1991, 1-8
24. Lisovik, L. P., The problem of inclusion and ambiguity for regular events in semigroups,Discritnaya Matematika (Moscow Nauka) 5, 1993, 54-74
25. Lisovik, L. P., The equivalence problem for finite substitutions on regular languages,Doklady of Academy of Sciences of Russia 357, 1997, 299-301
26. Lisovik, L. P., The equivalence problem for transducers with bounded number ofstates, Kibernetika and Sistemny Analiz 6, 1997, 109-114
27. Makanin, G. S., The problem of solvability of equations in a free semigroups, Mat.Sb. 103, 1977, 147-236; Math. USSR Sb. 32, 1977, 129-198
28. Schiitzenberger, M. P., Sur les relations rationelles entre monoides fibres, Theoret.Comput. Sci. 3, 1976, 243-259
29. Turakainen, P., On some transducer equivalence problems for families of languages,Intern. J. Comput. Math. 23, 1988, 99-124
30. Turakainen, P., The undecidability of some equivalence problems concerning ngsm'sand finite substitutions, Theoret. Comput. Sci. 174, 1997, 269-274
31. Weber, A., Decomposing finite-valued transducers and deciding their equivalence,SIAM J. Comput. 22, 1993, 175-202.