Abstract
We prove two results on commutation of languages. First, we show that the maximal language commuting with a three element language, i.e. its centralizer, is rational, thus giving an affirmative answer to a special case of a problem proposed by Conway in 1971. Second, we characterize all languages commuting with a three element code. The characterization is similar to the one proved by Bergman for polynomials over noncommuting variables, cf. Bergman, 1969 and Lothaire, 2000: A language commutes with a three element code X if and only if it is a union of powers of X.
Cite
CITATION STYLE
Karhumäki, J., & Petre, I. (2000). On the centralizer of a finite set. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1853, pp. 536–546). Springer Verlag. https://doi.org/10.1007/3-540-45022-x_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
