Periodicity and ultimate periodicity of DOL systems
Theoretical Computer Science
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Ensembles reconnaissables de mots bi -infinis limite et déterminisme
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
The Limit Set of Recognizable Substitution Systems
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Ensembles reconnaissables de mots biinfinis
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On a conjecture about finite fixed points of morphisms
Theoretical Computer Science - Combinatorics on words
| Hi-index | 5.23 |
Let &Sgr; be a finite alphabet, and let h:&Sgr;*&Sgr; be a morphism. Finite and infinite fixed points of morphismsi.e., those words w such that h(w)=wplay an important role in formal language theory. Head characterized the finite fixed points of h, and later, Head and Lando characterized the one-sided infinite fixed points of h. Our paper has two main results. First, we complete the characterization of fixed points of morphisms by describing all two-sided infinite fixed points of h, for both the "pointed" and "unpointed" cases. Second, we completely characterize the solutions to the equation h(xy)=yx in finite words.