scientific article; zbMATH DE number 3864526

MaRDI QIDQ3332270zbMATH OpenFDO

Authors Jean-Jacques Pansiot

Publication date 1984

zbMATH Keywords

DOL languagesinfinite wordsiterated morphismssubword complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• On the power of periodic iteration of morphisms
• scientific article; zbMATH DE number 1037960
• On factor complexity of morphic sequences
• On the Complexity of the Generalized Fibonacci Words

Cited in

(11)

• Every iterated morphism yields a co-CFL
• Separators in infinite words generated by morphisms.
• On the subword complexity of Thue-Morse polynomial extractions
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• Les premiers recursivement inaccessible et Mahlo et la theorie des dilatateurs
• The normal form of Borel sets. Part II: Borel sets of infinite rank
• Decidability of periodicity for infinite words
• Relations on words
• Two infinite words with cubic subword complexity
• Abelian combinatorics on words: a survey
• Complexity and palindromic defect of infinite words

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3332270)