Commutation with ternary sets of words

Theory of Computing Systems

Volumn 38, Issue 2, 2005, Pages 161-169

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

^a UNIVERSITY OF TURKU   (Finland)

^b UNIV LILLE   (France)

^c ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY POINTS; INTRIGUING QUESTIONS;

MATHEMATICAL TECHNIQUES;

COMPUTER SCIENCE;

EID: 20344371777     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1191-1     Document Type: Conference Paper

References (20)

1. Bergman, G.: Centralizers in free associative algebras, Trans. Amer. Math. Soc. 137 (1969), 327-344.
2. Berstel, J., Karhumäki, J. Combinatorics on Words - a tutorial, Bull. EATCS 79 (2003), 178-229.
3. Choffrut, C., Karhumäki, J.: Combinatorics of Words, in Rozenberg, G., Salomaa, A. (eds.), Handbook of Formal Languages, Vol. 1, Springer, New York, (1997), pp. 329-438.
4. Choffrut, C., Karhumäki, J., Ollinger, N. : The commutation of finite sets: a challenging problem, Theoret. Comput. Sci. 273 (1-2) (2002), 69-79.
5. Cohn, P.M. : Factorization in noncommuting power series rings, Proc. Cambridge Philos. Soc. 58 (1962), 452-464.
6. Cohn, P.M.: Centralisateurs dans les corps libres, in Berstel, J. (ed.), Series formelles, École Nat. Sup. Tech. Avancées, Paris (1978), pp. 45-54.
7. Conway, J.H.: Regular Algebra and Finite Machines, Chapman Hall, London (1971).
8. Harju, T., Karhumäki, J.: On the defect theorem and simplifiability, Semigroup Forum 33 (1986), 199-217.
9. Karhumäki, J.: Challenges of commutation: an advertisement, in Proc. of FCT 2001, LNCS 2138, Springer, Berlin, (2001), pp. 15-23.
10. Karhumäki, J., Latteux, M., Petre, I.: The commutation with codes and ternary sets of words, in Proc. of STACS 2003, LNCS 2607, Springer, Berlin, (2003), pp. 74-84.
11. Karhumäki, J., Petre, I.: On the centralizer of a finite set, in Proc. of ICALP 2000, LNCS 1853, Springer, Berlin, (2000), pp. 536-546.
12. Karhumäki, J., Petre, I.: Conway's problem and the commutation of languages, Bull. EATCS 74 (2001), 171-177.
13. Karhumäki, J., Petre, L: Conway's problem for three-word sets, Theoret. Comput. Sci. 289(1) (2002), 705-725.
14. Karhumäki, J., Petre, L: The branching point approach to Conway's problem, in Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.), Formal and Natural Computing, LNCS 2300, Springer, Berlin (2002), pp. 69-76.
15. Lothaire, M.: Combinatorics on Words, Addison-Wesley, Reading, MA (1983).
16. Lothaire, M.: Algebraic Combinatorics on Words, Cambridge University Press, Cambridge (2002).
17. Mateescu, A., Salomaa, A., Yu, S.: On the decomposition of finite languages, TUCS Technical Report 222, http://www.tucs.fi/ (1998).
18. Petre, I.: Commutation Problems on Sets of Words and Formal Power Series, Ph.D. Thesis, University of Turku (2002).
19. Ratoandromanana, B.: Codes et motifs, RAIRO Inform. Theor. 23(4) (1989), 425-444.
20. Reutenauer, C.: Centralizers of noncommutative series and polynomials, in Lothaire, M. (ed.), Algebraic Combinatorics on Words, Cambridge University Press, Cambridge (2002).