Mots sans carre et morphismes iterés

DOI10.1016/0012-365X(80)90151-XzbMath0444.20050MaRDI QIDQ1144665

Jean Berstel

Publication date: 1980

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

D0L systemnonrepetitive sequencetag-system

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05)

Related Items (21)

Applications of an infinite square-free co-CFL ⋮ Overlap-free morphisms and finite test-sets ⋮ Reduction in non-(k+ 1)-power-free morphisms ⋮ Estimates in Shirshov height theorem ⋮ Uniform tag systems for paperfolding sequences ⋮ A characterization of substitutive sequences using return words ⋮ Algèbres effectives dans la programmation logique avec contraintes ⋮ Sur les centres de DOL-langages ⋮ Sturmian images of non Sturmian words and standard morphisms ⋮ On the subword complexity of square-free DOL languages ⋮ Look and Say Fibonacci ⋮ A uniform cube-free morphism isk-power-free for all integersk≥ 4 ⋮ A new solution for Thue's problem ⋮ The critical exponent of the Arshon words ⋮ Production en temps réel et complexité de structure de suites infinies ⋮ On cube-free \(\omega\)-words generated by binary morphisms ⋮ Hierarchie et fermeture de certaines classes de tag-systèmes ⋮ A propos d'une conjecture de F. Dejean sur les répétitions dans les mots ⋮ On some generalizations of the Thue-Morse morphism. ⋮ Some results on \(k\)-power-free morphisms ⋮ Sequences generated by infinitely iterated morphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur un théorème de Thue
• Unending chess, symbolic dynamics and a problem in semi-groups
• 2726. A problem on strings of beads
• Wiederholungsfreie Folgen
• On the base-dependence of sets of numbers recognizable by finite automata
• Uniform tag sequences

This page was built for publication: Mots sans carre et morphismes iterés