Some applications of a theorem of Shirshov to language theory
Information and Control
Theoretical Computer Science
Every iterated morphism yields a co-CFL
Information Processing Letters
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
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
An example of an indexed language of intermediate growth
Theoretical Computer Science
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
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
Theory of Codes
Context-free languages of sub-exponential growth
Journal of Computer and System Sciences
Applications of an Infinite Squarefree CO-CFL
Proceedings of the 12th Colloquium on Automata, Languages and Programming
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
On the structure of the counting function of sparse context-free languages
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Factorial languages of low combinatorial complexity
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
This paper concerns some algebraic and algorithmical problems on the growth function of formal languages. In particular, we establish a regularity condition for sparse context-free languages.