On subword complexity functions

DOI10.1016/0166-218X(84)90102-1zbMath0562.68060MaRDI QIDQ1057070

Anni Sajo

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

context-free languagessubword complexitycyclic language

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (2)

Rhombellane space filling ⋮ Omega Polynomial in Nanostructures

Cites Work

• Subword complexities of various classes of deterministic developmental languages without interactions
• Unnamed Item
• Unnamed Item

This page was built for publication: On subword complexity functions