On the subword complexity of DOL languages with a constant distribution

DOI10.1016/0020-0190(81)90121-6zbMATH Open0546.68062OpenAlexW2010696838MaRDI QIDQ798008FDOQ798008

Authors: Andrzej Ehrenfeucht, Grzegorz Rozenberg 

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90121-6

Recommendations

• Subword complexity of uniform D0L words over finite groups
• scientific article; zbMATH DE number 1740040
• scientific article; zbMATH DE number 3872713
• Repetition of subwords in DOL languages
• The subword complexity of fixed points of binary uniform morphisms

zbMATH Keywords

subword complexityconstant distributionDOL language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Computing abelian complexity of binary uniform morphic words
• Title not available (Why is that?)
• Subword complexity of uniform D0L words over finite groups
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)