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

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

Volumn 2380 LNCS, Issue , 2002, Pages 812-820

  Karhumaki J ^a   Lisovik, L P ^b  

^a UNIVERSITY OF TURKU   (Finland)

^b TARAS SHEVCHENKO NATIONAL UNIVERSITY OF KYIV   (Ukraine)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

EQUIVALENCE PROBLEM; FINITE LANGUAGES; FINITE TRANSDUCERS; SYSTEMS OF EQUATIONS; UNDECIDABILITY;

EQUIVALENCE CLASSES;

EID: 0345223691     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_69     Document Type: Conference Paper

References (30)

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 Karhumäki, J., Systems of equations and Ehrenfeucht's conjecture, Discr. Math. 43, 1983, 139-153.
5. Culik II, K. and Karhumäki, J., The equivalence problem of finite valued transducers (on HDT0L languages) is decidable, Theoret. Comput. Sci. 47, 1986, 71-84.
6. Griffiths, T. V., The unsolvability of the equivalence problem for ?-free nondeterministic generalized machines, J. Assoc. Comput. Mach. 15, 1968, 409-413.
7. Gurari, E. and Ibarra, O., A note on finite-valued and finitely ambiguous transducers, Math. Syst. Theory 16, 1983, 61-66.
8. Guba, V. S., The equivalence of infinite systems of equations in free groups and semigroups with finite systems (in Russian), Mat. Zametki, 40, 1986, 321-324.
9. Halava, V. and Harju, T., Undecidability of the equivalence of finite substitutions on regular language, Theoret. Informat. and Appl. 33, 1999, 117-124.
10. Harju, T. and Karhumäki, J., The equivalence problem of multitape finite automata, Theoret. Comput. Sci. 78, 1991, 345-353.
11. Harju, T. and Karhumäki, J., Morphisms, in: G. Rozenberg and A. Salomaa (eds), Handbook of Formal Languages, Vol. I, Springer, 1997, 439-510.
12. Ibarra, O., The unsolvability of the equivalence problem for e-free NGSM's with unary input (output) alphabet and applications, SIAM J. Comput. 7, 1978, 524-532.
13. Karhumäki, J., Problem P 97, Bull. EATCS 25, 1985, 185.
14. Karhumäki, J., Challenges of commutation: an advertisement, Springer LNCS 2138, 2001, 15-23.
15. Karhumäki, J., Equations over finite sets of words and equivalence problems in automata theory, Theoret. Comput. Sci. 108, 1993, 103-118.
16. Karhumäki, J., Some open problems in combinatorics of words and related areas, RIMS Prodeedings 1166, Research Institute of Mathematical Sciences, Kyoto, 2000, 118-130.
17. Karhumäki, J. and Lisovik, L. P., On the equivalence of finite substitutions and transducers, in: J. Karhumäki, H. Maurer, Gh. Paun and G. Rozenberg (eds), Jewels are Forever, Springer, 1999, 97-108.
18. Karhumäki, J. and Lisovik, L. P., A simple undecidable problem: The inclusion problem for finite substitutions on ab * c, Inf. and Comput. (to appear); preliminaryversion in Springer LNCS 2010, 2001, 388-395.
19. Lawrence, J., The nonexistence of finite test set for set-equivalence of finite substitutions, Bull. EATCS 28, 1986, 34-37.
20. Lisovik, L. P., The identity problem of regular events over cartesian product of free and cyclic semigroups, Doklady of Academy of Sciences of Ukraine 6, 1979, 410-413.
21. Lisovik, L. P., An undecidability problem for countable Markov chains, Kibernetika 2, 1991, 1-8.
22. Lisovik, L. P., The problem of inclusion and ambiguity for regular events in semigroups, Discritnaya Matematika (Moscow Nauka) 5, 1993, 54-74.
23. Lisovik, L. P., The equivalence problem for finite substitutions on regular languages, Doklady of Academy of Sciences of Russia 357, 1997, 299-301.
24. Lisovik, L. P., The equivalence problem for transducers with bounded number of states, Kibernetika and Sistemny Analiz 6, 1997, 109-114.
25. Makanin, G. S., The problem of solvability of equations in a free semigroups, Mat. Sb. 103, 1977, 147-236;
26. Math. USSR Sb. 32, 1977, 129-198.
27. Schützenberger, M. P., Sur les relations rationelles entre monoides libres, Theoret. Comput. Sci. 3, 1976, 243-259.
28. Turakainen, P., On some transducer equivalence problems for families of languages, Intern. J. Comput. Math. 23, 1988, 99-124.
29. Turakainen, P., The undecidability of some equivalence problems concerning ngsm's and finite substitutions, Theoret. Comput. Sci. 174, 1997, 269-274.
30. Weber, A., Decomposing finite-valued transducers and deciding their equivalence, SIAM J. Comput. 22, 1993, 175-202