Reversal-bounded multipushdown machines
- 30 June 1974
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 8 (3), 315-332
- https://doi.org/10.1016/s0022-0000(74)80027-9
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Hardest Context-Free LanguageSIAM Journal on Computing, 1973
- On Languages Accepted in Polynomial TimeSIAM Journal on Computing, 1972
- Note on tape reversal complexity of languagesInformation and Control, 1970
- Principal AFLJournal of Computer and System Sciences, 1970
- An Infinite Hierarchy of Context-Free LanguagesJournal of the ACM, 1969
- The reduction of tape reversals for off-line one-tape Turing machinesJournal of Computer and System Sciences, 1968
- Tape-reversal bounded turing machine computationsJournal of Computer and System Sciences, 1968
- A note on undecidable properties of formal languagesTheory of Computing Systems, 1968
- One-way stack automataJournal of the ACM, 1967
- Finite-Turn Pushdown AutomataSIAM Journal on Control, 1966