scientific article; zbMATH DE number 3872713
From MaRDI portal
Publication:3339313
zbMATH Open0547.68078MaRDI QIDQ3339313FDOQ3339313
Authors: Andrzej Ehrenfeucht, Grzegorz Rozenberg 
Publication date: 1981
Title of this publication is not available (Why is that?)
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
homomorphismsquare-free wordssubword complexityDOL systemsEOL systemhomomorphic images of DOL languagesnonrepetitive words
Cited In (5)
- Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities
- On the subword complexity of DOL languages with a constant distribution
- An infinite square-free co-CFL
- Permutations are not context-free: An application of the interchange lemma
- The Thue problem and logical specifications of derivation in formal systems
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)
