scientific article; zbMATH DE number 6503311
From MaRDI portal
Publication:3450102
Recommendations
- LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS
- Languages with a finite antidictionary: growth-preserving transformations and available orders of growth
- Growth properties of power-free languages
- Growth properties of power-free languages
- Polynomial languages with finite antidictionaries
- Growth and ergodicity of context-free languages
- Growing grammars and length-reducing automata
- Context-free languages of sub-exponential growth
- The growth function of context-free languages
- Growth of power-free languages over large alphabets
Cited in
(7)- RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES
- Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions
- Polynomial languages with finite antidictionaries
- Factorial Languages of Low Combinatorial Complexity
- LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS
- Deciding WQO for factorial languages
- Languages with a finite antidictionary: growth-preserving transformations and available orders of growth
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450102)
