Commutation with codes

Theoretical Computer Science

Volumn 340, Issue 2, 2005, Pages 322-333

  Karhumäki, Juhani ^a   Latteux, Michel ^b   Petre, Ion ^a  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^b UNIV LILLE   (France)

Author keywords

Centralizer; Codes; Commutation; Conway's problem; Prefix codes

Indexed keywords

ALGEBRA; COMBINATORIAL MATHEMATICS; ELECTRIC COMMUTATION; FORMAL LANGUAGES; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CENTRALIZERS; CODES; CONWAY'S PROBLEM; PREFIX CODES;

CODES (SYMBOLS);

EID: 20344369536     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.03.037     Document Type: Article

References (28)

1. G. Bergman Centralizers in free associative algebras Trans. Amer. Math. Soc. 137 1969 327 344
2. J. Berstel, and D. Perrin Theory of Codes 1985 Academic Press New York
3. C. Choffrut, J. Karhumäki, Combinatorics of words, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, Springer, Berlin, 1997, pp. 329-438.
4. C. Choffrut, and J. Karhumäki On Fatou properties of rational languages C. Martin-Vide V. Mitrana Where Mathematics, Computer Science, Linguistics and Biology Meet 2000 Kluwer Dordrecht
5. C. Choffrut, J. Karhumäki, and N. Ollinger The commutation of finite sets: a challenging problem Theoret. Comput. Sci. 273 1-2 2002 69 79
6. P.M. Cohn Factorization in noncommuting power series rings Proc. Cambridge Philos. Soc. 58 1962 452 464
7. P.M. Cohn, Centralisateurs dans les corps libres, in: J. Berstel (Ed.), Séries formelles, Paris, 1978, pp. 45-54.
8. J.H. Conway Regular Algebra and Finite Machines 1971 Chapman & Hall London
9. J. Devolder, M. Latteux, I. Litovsky, and L. Staiger Codes and infinite words Acta Cybernet. 11 1994 241 256
10. J. Karhumäki, Challenges of commutation: an advertisement, in: Proc. of FCT 2001, Lecture Notes in Computer Science, Vol. 2138, Springer, Berlin, 2001, pp. 15-23.
11. J. Karhumäki, M. Latteux, and I. Petre The commutation with ternary sets of words Theory Comput. Systems, 38 2 2005 161 169
12. J. Karhumäki, L. Lisovik, The equivalence problem for finite substitutions on ab * c, with applications, IJFCS 14 (2003) 699-710;
13. preliminary version in Springer Lecture Notes in Computer Science, Vol. 2380, 2002, pp. 812-820.
14. J. Karhumäki, I. Petre, On the centralizer of a finite set, in: Proc. of ICALP 2000, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000, 536-546.
15. J. Karhumäki, and I. Petre Conway's Problem for three-word sets Theoret. Comput. Sci. 289/1 2002 705 725
16. J. Karhumäki, I. Petre, Two problems on commutation of languages, in: G. Paun, G. Rozenberg, A. Salomaa (Eds.), Current trends in Theoretical Computer Science (The Challenge of the New Century) Vol. 2, World Scientific 2004, pp. 477-494.
17. J. Karhumäki, I. Petre, The branching point approach to Conway's problem, Lecture Notes in Computer Science, Vol. 2300, Springer, Berlin, 2002, pp. 69-76.
18. M. Kunc, Regular solutions of language inequalities and well quasi-orders, in: Proc. of ICALP 2004, Lecture Notes in Computer Science, Vol. 3142, Springer, Berlin, 2004, pp. 870-881;
19. final version in Theoret. Comput. Sci. (2005), to appear.
20. M. Kunc, The power of commuting with finite sets of words, Lecture Notes in Computer Science, Vol. 3404, Springer, Berlin, 2005, pp. 569-580.
21. M. Lothaire Combinatorics on Words 1983 Addison-Wesley Reading, MA
22. M. Lothaire Algebraic Combinatorics on Words 2002 Cambridge University Press Cambridge
23. D. Perrin Codes conjugués Inform. Control 20 1972 222 231
24. I. Petre, Commutation problems on sets of words and formal power series, Ph.D. Thesis, University of Turku, 2002.
25. B. Ratoandromanana Codes et motifs RAIRO Inform. Theor. 23 4 1989 425 444
26. A. Restivo, Some decision results for recognizable sets in arbitrary monoids, in: Proc. of ICALP 1978, Lecture Notes in Computer Science, Vol. 62, Springer, Berlin, 1978, pp. 363-371.
27. C. Reutenauer Centralisers of noncommutative series and polynomials M. Lothaire Algebraic Combinatorics on Word 2002 Cambridge University Press Cambridge, USA 312 329
28. A. Salomaa, and S. Yu On the decomposition of finite languages G. Rozenberg W. Thomas Developments in Language Theory 2000 World Scientific Singapore 22 31