On sparseness, ambiguity and other decision problems for acceptors and transducers
3rd annual symposium on theoretical aspects of computer science on STACS 86
Analytic models and ambiguity of context-free languages
Theoretical Computer Science
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
On a conjecture about slender context-free languages
Theoretical Computer Science
Length considerations in context-free languages
Theoretical Computer Science - Special issue: formal language theory
On lengths of words in context-free languages
Theoretical Computer Science
The growth function of context-free languages
Theoretical Computer Science
On Parikh slender context-free languages
Theoretical Computer Science
Finiteness and Regularity in Semigroups and Formal Languages
Finiteness and Regularity in Semigroups and Formal Languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
On the context-freeness of the set of words containing overlaps
Information Processing Letters
Note: On the separability of sparse context-free languages and of bounded rational relations
Theoretical Computer Science
The Parikh counting functions of sparse context-free languages are quasi-polynomials
Theoretical Computer Science
On the growth of context-free languages
Journal of Automata, Languages and Combinatorics
Combinatorial complexity of regular languages
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Quasi-polynomials, linear Diophantine equations and semi-linear sets
Theoretical Computer Science
A representation theorem for (q-)holonomic sequences
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We give an exact description of the counting function of a sparse context-free language. Let L be a sparse context-free language and let fL be its counting function. Then there exist polynomials P0, P1,...,Pk - 1, with rational coefficients, and an integer constant k0, such that for any n ≥ k0 one has fL (n) = pj (n) where j is such that j ≡ n mod k. As a consequence one can easily show the decidability of some questions concerning sparse context-free languages. Finally, we show that for any sparse context-free language L there exists a regular language L' such that for any n ≥ 0 one has fL (n) = fL' (n) and, therefore, fL is rational.