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
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
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
Concrete Math
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Generating all permutations by context-free grammars in Chomsky normal form
Theoretical Computer Science - Algebraic methods in language processing
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
| Hi-index | 5.23 |
We consider context-free grammars G"n in Greibach normal form and, particularly, in Greibach m-form (m=1,2) which generates the finite language L"n of all n! strings that are permutations of n different symbols (n=1). These grammars are investigated with respect to their descriptional complexity, i.e., we determine the number of nonterminal symbols and the number of production rules of G"n as functions of n. As in the case of Chomsky normal form, these descriptional complexity measures grow faster than any polynomial function.