On the equivalence, containment, and covering problems for the regular and context-free languages
- 1 April 1976
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 12 (2) , 222-268
- https://doi.org/10.1016/s0022-0000(76)80038-4
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the time and tape complexity of languages IPublished by Association for Computing Machinery (ACM) ,1973
- On Languages Accepted in Polynomial TimeSIAM Journal on Computing, 1972
- On the Covering and Reduction Problems for Context-Free GrammarsJournal of the ACM, 1972
- A Note Concerning Nondeterministic Tape ComplexitiesJournal of the ACM, 1972
- The loop complexity of regular eventsInformation Sciences, 1969
- On the equivalence and containment problems for context-free languagesTheory of Computing Systems, 1969
- A note on undecidable properties of formal languagesTheory of Computing Systems, 1968
- A characterization of parenthesis languagesInformation and Control, 1967
- Parenthesis GrammarsJournal of the ACM, 1967
- Bounded regular setsProceedings of the American Mathematical Society, 1966