Polynomial Algorithms for Deterministic Pushdown Automata
- 1 November 1978
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 7 (4) , 405-412
- https://doi.org/10.1137/0207032
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the complexity of finite, pushdown, and stack automataTheory of Computing Systems, 1976
- The covering problem for linear context-free grammarsTheoretical Computer Science, 1976
- On the equivalence, containment, and covering problems for the regular and context-free languagesJournal of Computer and System Sciences, 1976
- Regularity and Related Problems for Deterministic Pushdown AutomataJournal of the ACM, 1975
- An improved bound for detecting looping configurations in deterministic DPA'SInformation Processing Letters, 1974
- Real-Time Strict Deterministic LanguagesSIAM Journal on Computing, 1972
- Time and tape complexity of pushdown automaton languagesInformation and Control, 1968
- Decidable and Undecidable Questions About AutomataJournal of the ACM, 1968
- Deterministic context free languagesInformation and Control, 1966
- On context-free languages and push-down automataInformation and Control, 1963