Mots sans carre et morphismes iterés
From MaRDI portal
Publication:1144665
DOI10.1016/0012-365X(80)90151-XzbMath0444.20050MaRDI QIDQ1144665
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
20M05: Free semigroups, generators and relations, word problems
Related Items
Production en temps réel et complexité de structure de suites infinies, The critical exponent of the Arshon words, A new solution for Thue's problem, A propos d'une conjecture de F. Dejean sur les répétitions dans les mots, Sequences generated by infinitely iterated morphisms, Applications of an infinite square-free co-CFL, On the subword complexity of square-free DOL languages, Uniform tag systems for paperfolding sequences, A characterization of substitutive sequences using return words, Some results on \(k\)-power-free morphisms, On cube-free \(\omega\)-words generated by binary morphisms, Hierarchie et fermeture de certaines classes de tag-systèmes, On some generalizations of the Thue-Morse morphism., Overlap-free morphisms and finite test-sets, Look and Say Fibonacci, Sur les centres de DOL-langages, Algèbres effectives dans la programmation logique avec contraintes
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
