The covering problem for linear context-free grammars
- 30 September 1976
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 2 (3) , 361-382
- https://doi.org/10.1016/0304-3975(76)90088-8
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the equivalence, containment, and covering problems for the regular and context-free languagesJournal of Computer and System Sciences, 1976
- On the Covering and Reduction Problems for Context-Free GrammarsJournal of the ACM, 1972
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Structural equivalence of context-free grammarsJournal of Computer and System Sciences, 1968
- A characterization of parenthesis languagesInformation and Control, 1967
- Parenthesis GrammarsJournal of the ACM, 1967