On a conjecture about finite fixed points of morphisms

DOI10.1016/j.tcs.2005.01.011zbMath1100.68089OpenAlexW2042436079WikidataQ123141193 ScholiaQ123141193MaRDI QIDQ557920

Jianyong Qiao, Sumit K. Garg

Publication date: 30 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.01.011

zbMATH Keywords

Fixed pointsCombinatorics on wordsMorphisms

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (7)

The Billaud conjecture for \(|\varSigma| = 4\), and beyond ⋮ Counting Ordered Patterns in Words Generated by Morphisms ⋮ The unambiguity of segmented morphisms ⋮ On Billaud words and their companions ⋮ On Billaud words and their companions ⋮ Morphically primitive words ⋮ UNAMBIGUOUS MORPHIC IMAGES OF STRINGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some equations in free partially commutative monoids
• On the fixpoints of monogenic functions in free monoids
• Fixed languages and the adult languages of ol schemest^†
• Context free languages in biological systems
• On the distribution of characteristic parameters of words
• On the distribution of characteristic parameters of words II
• Words and special factors
• Proof of a conjecture on word complexity
• On two-sided infinite fixed points of morphisms

This page was built for publication: On a conjecture about finite fixed points of morphisms