On the subword complexity of DOL languages with a constant distribution
From MaRDI portal
(Redirected from Publication:798008)
Recommendations
Cites work
- scientific article; zbMATH DE number 3661611 (Why is no real title available?)
- scientific article; zbMATH DE number 3767067 (Why is no real title available?)
- scientific article; zbMATH DE number 3780589 (Why is no real title available?)
- scientific article; zbMATH DE number 3569855 (Why is no real title available?)
- On the subword complexity of square-free DOL languages
Cited in
(14)- On the D0L Repetition Threshold
- On the asymptotic abelian complexity of morphic words
- scientific article; zbMATH DE number 1396706 (Why is no real title available?)
- Computing abelian complexity of binary uniform morphic words
- Subword complexity of uniform D0L words over finite groups
- scientific article; zbMATH DE number 1740040 (Why is no real title available?)
- Asymptotic subword complexity of fixed points of group substitutions
- On the subword complexity of m-free DOL languages
- On the subword complexity of locally catenative DOL languages
- On the size of the alphabet and the subword complexity of square-free DOL languages
- scientific article; zbMATH DE number 3872713 (Why is no real title available?)
- scientific article; zbMATH DE number 3961004 (Why is no real title available?)
- Infinite words with linear subword complexity
- A combinatorial theorem on $p$-power-free words and an application to semigroups
This page was built for publication: On the subword complexity of DOL languages with a constant distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798008)
