Note on tape reversal complexity of languages
- 30 September 1970
- journal article
- Published by Elsevier in Information and Control
- Vol. 17 (2), 203-215
- https://doi.org/10.1016/s0019-9958(70)90549-8
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Time and tape complexity of pushdown automaton languagesInformation and Control, 1968
- 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
- Computational Complexity of One-Tape Turing Machine ComputationsJournal of the ACM, 1968
- Two-way pushdown automataInformation and Control, 1967
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- A note on computing time for recognition of languages generated by linear grammarsInformation and Control, 1967
- Two-Tape Simulation of Multitape Turing MachinesJournal of the ACM, 1966
- One-tape, off-line Turing machine computationsInformation and Control, 1965
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959