Conway's problem for three-word sets

Theoretical Computer Science

Volumn 289, Issue 1, 2002, Pages 705-725

  Karhumäki, Juhani ^a   Petre, Ion ^a  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMBINATORIAL MATHEMATICS; FORMAL LANGUAGES; POLYNOMIALS;

RATIONAL LANGUAGES;

SET THEORY;

EID: 0037163941     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00389-9     Document Type: Article

References (15)

1. Bergman G. Centralizers in free associative algebras. Trans. Am. Math. Soc. 137:1969;327-344.
2. Choffrut C., Karhumäki J. Combinatorics on words. Rozenberg G., Salomaa A. Handbook of Formal Languages, Vol. 1. 1997;329-438 Springer-Verlag, Berlin.
3. C. Choffrut, J. Karhumäki, On Fatou properties of rational languages, in: C. Martin-Vide, V. Mitrana (Eds.), Where mathematics, Computer Science, Linguistics and Biology Meet, Kluwer, 2000.
4. C. Choffrut, J. Karhumäki, N. Ollinger, The commutation of finite sets: a challenging problem, TUCS Technical Report 303, (URL: http://www.tucs.fi/), 1999, special issue on Words'99 of Theoret. Comput. Sci., to appear.
5. P.M. Cohn, Factorization in noncommuting power series rings, Proc. Cambridge Philos. Soc. 58 (1962) 452-464.
6. Conway J.H. Regular Algebra and Finite Machines. 1971;Chapman & Hall, London.
7. Eilenberg S. Automata, Languages and Machines. 1974;Academic Press, Tunbridge Wells, UK.
8. L. Kari, On insertion and deletion in formal languages, Ph.D. Thesis, University of Turku, 1991.
9. J. Karhumäki, I. Petre, On the centralizer of a finite set, Proc. ICALP 2000, Lecture Notes in Computer Science, Vol. 1853, 2000, Springer, Berlin, pp. 536-546.
10. Karhumäki J., Petre I. Conway's problem and the commutation of languages. Bull. EATCS. 74:2001;171-177.
11. Leiss E. Language Equations. 1998;Springer, Berlin.
12. Lothaire M. Combinatorics on Words. 1983;Addison-Wesley, Reading, MA.
13. M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, Cambridge, to appear, 2002.
14. A. Mateescu, A. Salomaa, S. Yu, On the decomposition of finite languages, Technical Report 222, TUCS, (URL: http://www.tucs.fi/), 1998.
15. Ratoandromanana B. Codes et motifs. RAIRO Inform. Theor. 23(4):1989;425-444.