Complexity of normal form grammars
Author:
- Alica KelemenováAKAlica Kelemenová
- 1 January 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 28 (3) , 299-314
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A Supernormal-Form Theorem for Context-Free GrammarsJournal of the ACM, 1983
- Position-restricted grammar forms and grammarsTheoretical Computer Science, 1982
- Big Omicron and big Omega and big ThetaACM SIGACT News, 1976
- Non-context-free grammars generating context-free languagesInformation and Control, 1974
- Some classifications of context-free languagesInformation and Control, 1969