LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS

DOI10.1142/S0129054114400164zbMath1317.68102OpenAlexW2104040325MaRDI QIDQ5247167

Arseny M. Shur

Publication date: 23 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054114400164

zbMATH Keywords

growth rateregular languagefinite automatoncombinatorial complexitystate graphantidictionary

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Cites Work

• Automata and forbidden words
• Growth properties of power-free languages
• Growth of finitely generated solvable groups
• Graded algebras
• Symbolic Dynamics

This page was built for publication: LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS