Challenges of commutation: An advertisement

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

Volumn 2138, Issue , 2001, Pages 15-23

  Karhumäki, Juhani ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FORMULATED PROBLEMS;

COMPUTATION THEORY;

EID: 84974674499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44669-9_3     Document Type: Conference Paper

References (16)

1. G. Bergman, Centralizers in free associative algebras, Trans. Amer. Math. Soc. 137, 327–344, 1969.
2. C. Choffrut and J. Karhumäki, Combinatorics of Words, In: G. Rozenberg and A. Salomaa (eds), Handbook of Formal Languages, vol. 1, 329–438, Springer, 1997.
3. C. Choffrut, J. Karhumäki and N. Ollinger, The commutation of finite sets: a challenging problem, Theoret. Comput. Sci., to appear.
4. P. M. Cohn, Centralizateurs dans les corps libre, In: J. Berstel (ed.), Séries Formelles 45–54, Paris, 1978.
5. J. H. Conway, Regular Algebra and Finite Machines, Chapman Hall, 1971.
6. K. Culik II and J. Karhumäki, manuscript, in preparation.
7. T. Harju, O. Ibarra, J. Karhumäki and A. Salomaa, Decision problems concerning semilinearity, morphisms and commutation of languages, Proceedings of ICALP01, to appear.
8. T. Harju and I. Petre, On commutation and primitive roots of codes, manuscript.
9. G. Higman, Ordering with divisibility in abstract algebras, Proc. London Math. Soc. 3, 326–336, 1952.
10. M. Hirvensalo, personal commutation.
11. J. Karhumäki and I. Petre, Conway’s problem for three word sets, Theoret. Comput. Sci., to appear; preliminary version in LNCS 1853, 536–546.
12. M. Minsky, Computation: Finite and Infinite Machines, Prentice Hall, 1967.
13. D. Perrin, Codes conjugués, Inform. and Control 20, 221–231, 1972.
14. B. Ratoandramanana, Codes et motifs, RAIRO Theoret. Inform. 23, 425–444, 1989.
15. Ch. Reutenauer, Centralizers of Noncommutative Series and Polynomials, In: M. Lothaire, Algebraic Combinatorics on Words, Chapter 9, Cambridge University Press, to appear.
16. K. Ruohonen, Reversible machines and Post’s correspondence problem for biprefix morphisms, J. Inform. Process. Cybernet. EIK 21, 579–595, 1985.