Nondeterminism and boolean operations in pda's
- 1 June 1978
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 16 (3) , 456-461
- https://doi.org/10.1016/0022-0000(78)90030-2
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Reversal-Bounded Acceptors and Intersections of Linear LanguagesSIAM Journal on Computing, 1974
- Jump PDA’s and Hierarchies of Deterministic Context-Free LanguagesSIAM Journal on Computing, 1974
- An infinite hierarchy of intersections of context-free languagesTheory of Computing Systems, 1973
- Deterministic Pushdown Store Machines and Real-Time ComputationJournal of the ACM, 1971
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Deterministic context free languagesInformation and Control, 1966
- On the translation of languages from left to rightInformation and Control, 1965
- Note on the boolean properties of context free languagesInformation and Control, 1960