Refining nondeterminism in context-free languages
- 1 December 1978
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 12 (1) , 1-8
- https://doi.org/10.1007/bf01776563
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Computations with a restricted number of nondeterministic steps (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1977
- An infinite hierarchy of intersections of context-free languagesTheory of Computing Systems, 1973
- The Boolean Closures of the Deterministic and Nondeterministic Context-Free LanguagesPublished by Springer Nature ,1973
- Intercalation theorems for stack languagesPublished by Association for Computing Machinery (ACM) ,1969
- Deterministic context free languagesInformation and Control, 1966
- Ambiguity in context free languagesJournal of the ACM, 1966