LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS

DOI10.1142/S0129054114400164MaRDI QIDQ5247167zbMATHOpenAlexFDO

Authors 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 languagestate graphcombinatorial complexityfinite automatonantidictionary

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6503311
• Languages with a finite antidictionary: growth-preserving transformations and available orders of growth
• Polynomial languages with finite antidictionaries
• On possible growths of Toeplitz languages
• Growth properties of power-free languages
• Growth properties of power-free languages
• Growth of power-free languages over large alphabets
• Growth of power-free languages over large alphabets
• Context-free languages of sub-exponential growth
• Finite-word hyperlanguages

Cites work

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

Cited in

(5)

• RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES
• Languages with a finite antidictionary: growth-preserving transformations and available orders of growth
• scientific article; zbMATH DE number 6503311 (Why is no real title available?)
• Factorial Languages of Low Combinatorial Complexity
• Deciding WQO for factorial languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5247167)