Generating all permutations by context-free grammars in Chomsky normal form
- 21 March 2006
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 354 (1) , 118-130
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The inclusion problem for some subclasses of context-free languagesTheoretical Computer Science, 2000
- A frame for general divide-and-conquer recurrencesInformation Processing Letters, 1996
- A lower-bound for the number of productions required for a certain class of languagesDiscrete Applied Mathematics, 1983
- Complexity of normal form grammarsTheoretical Computer Science, 1983
- Context-free complexity of finite languagesTheoretical Computer Science, 1983
- Functional Programs for Generating PermutationsThe Computer Journal, 1982
- A note on a problem in the theory of grammatical complexityTheoretical Computer Science, 1981
- Concise description of finite languagesTheoretical Computer Science, 1981
- Some classifications of context-free languagesInformation and Control, 1969
- Two Families of Languages Related to ALGOLJournal of the ACM, 1962