An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Systems of functional equations
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Semirings and formal power series: their relevance to formal languages and automata
Handbook of formal languages, vol. 1
Introduction to Formal Language Theory
Introduction to Formal Language Theory
On the entropy of regular languages
Theoretical Computer Science - WORDS
On the entropy of regular languages
Theoretical Computer Science - WORDS
Optimizing markov models with applications to triangular connectivity coding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Computer Science
Groups, graphs, languages, automata, games and second-order monadic logic
European Journal of Combinatorics
| Hi-index | 0.00 |
A language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of subwords F yields a sub-language LF whose exponential growth rate is smaller than that of L. It is shown that every (essentially) ergodic non-linear context-free language of convergent type is growth-sensitive. "Ergodic" means that the dependency di-graph of the generating context-free grammar is strongly connected, and "essentially ergodic" means that there is only one nonregular strong component in that graph. The methods combine (1) an algorithm for constructing from a given grammar one that generates the associated 2-block language and (2) a generating function technique regarding systems of algebraic equations. Furthermore, the algorithm of (1) preserves unambiguity as well as the number of non-regular strong components of the dependency di-graph.