The equivalence problem for deterministic finite-turn pushdown automata
- 30 June 1974
- journal article
- Published by Elsevier in Information and Control
- Vol. 25 (2) , 123-133
- https://doi.org/10.1016/s0019-9958(74)90839-0
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Real-Time Strict Deterministic LanguagesSIAM Journal on Computing, 1972
- Properties of deterministic top-down grammarsInformation and Control, 1970
- Deterministic context free languagesInformation and Control, 1966
- Finite-Turn Pushdown AutomataSIAM Journal on Control, 1966