Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities

DOI10.1016/0020-0190(89)90055-0zbMath0678.68064OpenAlexW2066262281MaRDI QIDQ1124353

Gerd Baron, Friedrich J. Urbanek

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90055-0

zbMATH Keywords

formal languagessubword complexitygrowth functionfactorial languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Factorial languages whose growth function is quadratically upper bounded

This page was built for publication: Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities