Abstract
We solve the commutation equation AB = BA for binary factorial languages A and B. As we show, the situations when such languages commute can be naturally classified. The result is based on the existence and uniqueness of a canonical decomposition of a factorial language, proved by S. V. Avgustinovich and the author in 2005. It continues investigation of the semigroup of factorial languages.
Supported in part by RFBR grants 05-01-00364 and 06-01-00694.
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
Avgustinovich, S.V., Frid, A.E.: A unique decomposition theorem for factorial languages. Internat. J. Algebra Comput. 15, 149–160 (2005)
Conway, J.H.: Regular Algebra and Finite Machines. Chapman & Hall, London (1971)
Diekert, V.: Makanin’s Algorithm. In: Lothaire, M. (ed.) Algebraic combinatorics on words, pp. 387–442. Cambridge Univ. Press, Cambridge (2002)
Frid, A.E.: Canonical decomposition of a catenation of factorial languages. Siberian Electronic Mathematical Reports 4, 14–22 (2007), http://semr.math.nsc.ru/2007/V4/p12-19.pdf
Karhumäki, J., Latteux, M., Petre, I.: Commutation with codes. Theoret. Comput. Sci. 340, 322–333 (2005)
Karhumäki, J., Latteux, M., Petre, I.: The commutation with ternary sets of words. Theory Comput. Systems 38, 161–169 (2005)
Kunc, M.: The power of commuting with finite sets of words. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 569–580. Springer, Heidelberg (2005), Full version currently available at http://math.muni.cz/~kunc/math/commutativity.pdf
Lothaire, M.: Combinatorics on words. Addison-Wesley, London (1983)
Ratoandromanana, B.: Codes et motifs, RAIRO. Inform. Theor. 23, 425–444 (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frid, A.E. (2007). Commutation of Binary Factorial Languages. In: Harju, T., Karhumäki, J., Lepistö, A. (eds) Developments in Language Theory. DLT 2007. Lecture Notes in Computer Science, vol 4588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73208-2_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-73208-2_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73207-5
Online ISBN: 978-3-540-73208-2
eBook Packages: Computer ScienceComputer Science (R0)