Abstract
We consider a few problems connected to the commutation of languages, in particular finite ones. The goal is to emphasize the challenging nature of such simply formulated problems. In doing so we give a survey of results achieved during the last few years, restate several open problems and illustrate some approaches to attack such problems by two simple constructions.
Part of this work was done while the author visited LIAFA at Denis Diderot University. Supported also by the grant 44087 of the Academy of Finland.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. Bergman, Centralizers in free associative algebras, Trans. Amer. Math. Soc. 137, 327–344, 1969.
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.
C. Choffrut, J. Karhumäki and N. Ollinger, The commutation of finite sets: a challenging problem, Theoret. Comput. Sci., to appear.
P. M. Cohn, Centralizateurs dans les corps libre, In: J. Berstel (ed.), Séries Formelles 45–54, Paris, 1978.
J. H. Conway, Regular Algebra and Finite Machines, Chapman Hall, 1971.
K. Culik II and J. Karhumäki, manuscript, in preparation.
T. Harju, O. Ibarra, J. Karhumäki and A. Salomaa, Decision problems concerning semilinearity, morphisms and commutation of languages, Proceedings of ICALP01, to appear.
T. Harju and I. Petre, On commutation and primitive roots of codes, manuscript.
G. Higman, Ordering with divisibility in abstract algebras, Proc. London Math. Soc. 3, 326–336, 1952.
M. Hirvensalo, personal commutation.
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.
M. Minsky, Computation: Finite and Infinite Machines, Prentice Hall, 1967.
D. Perrin, Codes conjugués, Inform. and Control 20, 221–231, 1972.
B. Ratoandramanana, Codes et motifs, RAIRO Theoret. Inform. 23, 425–444, 1989.
Ch. Reutenauer, Centralizers of Noncommutative Series and Polynomials, In: M. Lothaire, Algebraic Combinatorics on Words, Chapter 9, Cambridge University Press, to appear.
K. Ruohonen, Reversible machines and Post’s correspondence problem for biprefix morphisms, J. Inform. Process. Cybernet. EIK 21, 579–595, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karhumäki, J. (2001). Challenges of Commutation. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_3
Download citation
DOI: https://doi.org/10.1007/3-540-44669-9_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42487-1
Online ISBN: 978-3-540-44669-9
eBook Packages: Springer Book Archive