Combinatorial and computational problems on finite sets of words

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

Volumn 2055 LNCS, Issue , 2001, Pages 69-81

  Karhumaki, Juhani ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

MICROCONTROLLERS;

COMPUTATIONAL PROBLEM; CONJUGACY; FINITE SET; MORPHISMS; NATURAL EXTENSION;

SET THEORY;

EID: 2442622138     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45132-3_4     Document Type: Conference Paper

References (27)

1. Albert, M. H. and Lawrence, J., A proof of Ehrenfeucht's Conjecture, Theoret. Comput. Sci 41, pp. 121-123, 1985.
2. Bergman, G. Centralizers in free associative algebras, Transactions of the American Mathematical Society 137, pp. 327-344, 1969.
3. Cassaigne, J., Karhumäki, J., and Manuch, J., On conjugacy of languages, manuscript in preparation.
4. Crochemore, M. and Rytter, W., Text Algorithms, Oxford University Press, 1994.
5. Choffrut, C. and Karhumäki, J., Combinatorics on Words. In G. Rozenberg, A. Salomaa (eds.) Handbook of Formal Languages, vol 1, pp. 329-438, Springer-Verlag 1997.
6. Choffrut, C., Karhumäki, J., and Ollinger, N., The Commutation of finite sets: a challenging problem. Theoret. Comput. Sci., to appear.
7. Conway, J., Regular Algebra and Finite Machines, Chapman Hall, 1971.
8. Culik II, K. and Karhumäki, J., the equivalence of finite valued transducers (on HDT0L languages) is decidable, Theoret. Comput. Sci 47, pp. 71-84, 1986.
9. Diekert, V., Makanin's Algorithm in M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, to appear.
10. Guba, V. S., The equivalence of infinite systems of equations in free groups and semigroups with finite systems (in Russian), Mat. Zametki 40, pp. 321-324, 1986.
11. Makanin, S. G., The problem of solvability of equation in a free semigroup, Mat. Sb. 103, pp. 147-236, 1977
12. (English transl. in Math USSR Sb. 32, pp. 129-198).
13. Halava, V. and Harju, T., Undecidability of the equivalence of finite substitutions on regular language, Theoret. Inform. and Appl. 33, pp. 117-124, 1999.
14. Harju, T., Ibarra, O., Karhumäki, J. and Salomaa, A., Decision questions concerning semilinearity, morphisms and commutation of languages, TUCS report 376, 2000.
15. Harju, T., Petre, I., personal communication.
16. Hopcroft, J. and Ullman, J. D., Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA., 1979.
17. Karhumäki, J., Some open problems on combinatorics of words and related areas, Proceedings of Algebraic Systems, Formal Languages and Computations, RIMS Proceedings 1166, Research Institute for Mathematical Sciences, Kyoto University, pp. 118-130, 2000.
18. Karhumäki, J. and Lisovik, L. On the equivalence of finite substitutions and transducers, In J. Karhumäki, H. Maurer, Gh. Pǎun and G. Rozenberg (eds.) Jewels are Forever, pp. 97-108, Springer 1999.
19. Karhumäki, J. and Lisovik, L., A simple undecidable problem: The inclusion problem for finite substitutions on ab*c, Proceedings of STACS01, Lecture Notes in Computer Science, to appear.
20. Karhumäki, J., Mignosi, F., and Plandowski, W., On expressibility of languages and relations by word equations, JACM 47, 2000.
21. Karhumäki, J. and Petre, I., On the centralizer of a finite set, Proceedings of ICALP 00, Lecture Notes in Computer Science 1853, 536-546, 2000.
22. Lawrence, J., The non-existence of finite test sets for set equivalence of finite substitutions, Bull. EATCS 28, pp. 34-37, 1986.
23. Lisovik, L. P., The equivalence problem for finite substitutions on regular languages, Doklady of Academy of Sciences of Russia 357, pp. 299-301, 1997.
24. Lothaire, M., Combinatorics on Words, Adison-Wesley, Reading, MA., 1983.
25. Plandowski, W., Satisfiability of word equations with constants is in PSPACE, proceedings of FOCS'99, pp. 495-500, 1999.
26. Ratoandramanana, B., Codes et motifs, RAIRO Inform. Theor., 23:4, pp. 425-444, 1989.
27. Turakainen, P., On some transducer equivalence problems for families of languages, Intern. J. Computer Math. 23, 99-124, 1988.