scientific article; zbMATH DE number 3872713

MaRDI QIDQ3339313zbMATH OpenFDO

Authors Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date 1981

zbMATH Keywords

homomorphismsquare-free wordssubword complexityDOL systemsEOL systemhomomorphic images of DOL languagesnonrepetitive words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the subword complexity of DOL languages with a constant distribution
• Repetition of subwords in DOL languages
• On k-repetition freeness of length uniform morphisms over a binary alphabet
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• Subword complexity of uniform D0L words over finite groups

Cited in

(5)

• Permutations are not context-free: An application of the interchange lemma
• The Thue problem and logical specifications of derivation in formal systems
• An infinite square-free co-CFL
• On the subword complexity of DOL languages with a constant distribution
• Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities

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 Q3339313)