One-way multihead writing finite automata
- 31 January 1976
- journal article
- Published by Elsevier in Information and Control
- Vol. 30 (1) , 1-20
- https://doi.org/10.1016/s0019-9958(76)90426-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On tape-bounded complexity classes and multihead finite automataJournal of Computer and System Sciences, 1975
- Bounded-reversal multihead finite automata languagesInformation and Control, 1974
- Simple matrix languagesInformation and Control, 1970
- Über einen Automaten mit PufferspeicherungComputing, 1970
- Multi-tape and multi-head pushdown automataInformation and Control, 1968
- Computational Complexity of One-Tape Turing Machine ComputationsJournal of the ACM, 1968
- On Multi-Head Finite AutomataIBM Journal of Research and Development, 1966
- One-tape, off-line Turing machine computationsInformation and Control, 1965
- Classes of languages and linear-bounded automataInformation and Control, 1964
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959