The commutation with codes and ternary sets of words

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

Volumn 2607, Issue , 2003, Pages 74-84

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

^a UNIVERSITY OF TURKU   (Finland)

^b UNIV LILLE   (France)

^c ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES;

BOUNDARY POINTS; COMBINATORICS ON WORDS; FORMAL POWER SERIES; PRIMITIVE ROOTS; TERNARY CODES;

C (PROGRAMMING LANGUAGE);

EID: 35248863505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_8     Document Type: Article

References (23)

1. Autebert, J.M., Boasson, L., Latteux, M.: Motifs et bases de langages, RAIRO Inform. Theor., 23(4) (1989) 379-393.
2. Bergman, G.: Centralizers in free associative algebras, Transactions of the American Mathematical Society 137 (1969) 327-344.
3. Berstel, J., Perrin, D.: Theory of Codes, Academic Press, New York (1985).
4. Choffrut, C., Karhumäki, J.: Combinatorics of Words. In Rozenberg, G., Salomaa, A. (eds.), Handbook of Formal Languages, Vol. 1, Springer-Verlag (1997) 329-438.
5. Choffrut, C., Karhumäki, J.: On Fatou properties of rational languages, in Martin-Vide, C., Mitrana, V. (eds.), Where mathematics, Computer Science, Linguistics and Biology Meet, Kluwer, Dordrecht (2000).
6. Choffrut, C., Karhumäki, J., Ollinger, N.: The commutation of finite sets: a challenging problem, Theoret. Comput. Sci., 273 (1-2) (2002) 69-79.
7. Cohn, P.M.: Factorization in noncommuting power series rings, Proc. Cambridge Philos. Soc. 58 (1962) 452-464.
8. Cohn, P.M.: Centralisateurs dans les corps libres, in Berstel, J. (ed.), Séries formelles, Paris, (1978) 45-54.
9. Conway, J.H.: Regular Algebra and Finite Machines, Chapman Hall (1971).
10. Devolder, J., Latteux, M., Litovsky, I., Staiger, L.: Codes and infinite words, Acta Cybernetica 11 (1994) 241-256.
11. Harju, T., Petre, I.: On commutation and primitive roots of codes, submitted. A preliminary version of this paper has been presented at WORDS 2001, Palermo, Italy.
12. Karhumäki, J.: Challenges of commutation: an advertisement, in Proc. of FCT 2001, LNCS 2138, Springer (2001) 15-23.
13. Karhumäki, J., Petre, I.: On the centralizer of a finite set, in Proc. of ICALP 2000, LNCS 1853, Springer (2000) 536-546.
14. Karhumäki, J., Petre, I.: Conway's Problem for three-word sets, Theoret. Comput. Sci., 289/1 (2002) 705-725.
15. Karhumäki, J., Petre, I.: Conway's problem and the commutation of languages, Bulletin of EATCS 74 (2001) 171-177.
16. Karhumäki, J., Petre, I.: The branching point approach to Conway's problem, LNCS 2300, Springer (2002) 69-76.
17. Lothaire, M.: Combinatorics on Words (Addison-Wesley, Reading, MA., (1983).
18. Lothaire, M.: Algebraic Combinatorics on Words (Cambridge University Press), (2002).
19. Mateescu, A., Salomaa, A., Yu, S.: On the decomposition of finite languages, TUCS Technical Report 222, http://www.tucs.fi/ (1998).
20. Petre, I.: Commutation Problems on Sets of Words and Formal Power Series, PhD Thesis, University of Turku (2002).
21. Ratoandromanana, B.: Codes et motifs, RAIRO Inform. Theor., 23(4) (1989) 425-444.
22. Restivo, A.: Some decision results for recognizable sets in arbitrary monoids, in Proc. of ICALP 1978, LNCS 62 Springer (1978) 363-371.
23. Shyr, H.J.: Free monoids and languages, Hon Min Book Company, (1991).