# A characterization of poly-slender context-free languages

@article{Ilie2000ACO,
title={A characterization of poly-slender context-free languages},
author={Lucian Ilie and Grzegorz Rozenberg and Arto Salomaa},
journal={RAIRO Theor. Informatics Appl.},
year={2000},
volume={34},
pages={77-86}
}
• Published 2000
• Computer Science
• RAIRO Theor. Informatics Appl.
For a non-negative integer k , we say that a language L is k -poly-slender if the number of words of length n in L is of order ${\cal O}(n^k)$ . We give a precise characterization of the k -poly-slender context-free languages. The well-known characterization of the k -poly-slender regular languages is an immediate consequence of ours.
Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata
It is shown that every linear-slender context-free language is recognizable by a real time one-way cellular automaton.
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
• Computer Science
Developments in Language Theory
• 2008
An O(n+ t) time algorithm is given to determine whether an NFA with nstates and ttransitions accepts a language of polynomial or exponential growth and how to solve these problems for context-free grammars.
Periodic and Sturmian languages
• Linguistics, Computer Science
Inf. Process. Lett.
• 2006
On the structure of context-free languages
• Mathematics
• 2015
We discuss the following result. Given two languages L1;L2 A , we say that L1 is commutatively equivalent to L2 if there exists a bijection f : L1 ! L2 from L1 onto L2 such that, for every u2 L1,
Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time
• Computer Science
Int. J. Found. Comput. Sci.
• 2010
An O(n + t) time algorithm is given to determine whether an NFA with n states and t transitions accepts a language of polynomial or exponential growth and how to solve these problems for context-free grammars.

## References

SHOWING 1-10 OF 38 REFERENCES
On lengths of words in context-free languages
Decision problems concerning thinness and slenderness of formal languages
• J. Honkala
• Linguistics, Computer Science
Acta Informatica
• 1998
It is shown that all four properties of Parikh thin and Parikh slender languages are decidable for bounded semilinear languages but undecidable for DT0L languages.
Thin and Slender Languages
• Computer Science
Discret. Appl. Math.
• 1995
Length Considerations in Context-Free Languages
• D. Raz
• Computer Science
Theor. Comput. Sci.
• 1997
Semi-discrete context-free languages †
• Computer Science
• 1983
It is shown that a language is semi-discrete and context-free iff it is a discrete union of languages of the form , iffit is a finite disjoint union of discrete context- free languages.
On Parikh Slender Languages and Power Series
• J. Honkala
• Computer Science
J. Comput. Syst. Sci.
• 1996
A new method for ambiguity proofs of context-free languages and a new proof of an earlier result of Autebert, Flajolet, and Gabarro concerning prefixes of infinite words are obtained.
Characterizing Regular Languages with Polynomial Densities
• Mathematics
MFCS
• 1992
It is shown that the function p R(n) of a regular language R is O(n k ), for some k≥0, if and only if R can be represented as a finite union of the regular expressions of the form xy 1 * z1 ...y t * zt with a nonnegative integer t≤k+1.
H-Bounded and Semi-discrete Languages
• Mathematics
Inf. Control.
• 1981