The state complexities of some basic operations on regular languages
Theoretical Computer Science
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
A frame for general divide-and-conquer recurrences
Information Processing Letters
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
The inclusion problem for some subclasses of context-free languages
Theoretical Computer Science
Introduction to Formal Language Theory
Introduction to Formal Language Theory
A Polynomial Algorithm for the Inference of Context Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Generating all permutations by context-free grammars in Greibach normal form
Theoretical Computer Science
Using Contextual Representations to Efficiently Learn Context-Free Languages
The Journal of Machine Learning Research
Generating all circular shifts by context-free grammars in Chomsky normal form
Journal of Automata, Languages and Combinatorics
Lower bounds for context-free grammars
Information Processing Letters
Permuting operations on strings and their relation to prime numbers
Discrete Applied Mathematics
Planar languages and learnability
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
| Hi-index | 0.00 |
Let Ln be the finite language of all n! strings that are permutations of n different symbols (n ≥ 1). We consider context-free grammars Gn in Chomsky normal form that generate Ln. In particular we study a few families {Gn}n ≥ 1, satisfying L(Gn) = Ln for n ≥ 1, with respect to their descriptional complexity, i.e. we determine the number of nonterminal symbols and the number of production rules of Gn as functions of n.