Time and tape complexity of pushdown automaton languages
- 30 September 1968
- journal article
- Published by Elsevier BV in Information and Control
- Vol. 13 (3), 186-206
- https://doi.org/10.1016/s0019-9958(68)91087-5
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Two-way pushdown automataInformation and Control, 1967
- Recognition and parsing of context-free languages in time n3Information and Control, 1967
- Deterministic context free languagesInformation and Control, 1966
- On the translation of languages from left to rightInformation and Control, 1965
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965