One way finite visit automata
- 31 December 1978
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 6 (2) , 175-221
- https://doi.org/10.1016/0304-3975(78)90035-x
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Simple Representations of Certain Classes of LanguagesJournal of the ACM, 1978
- Uniformly erasable AFLJournal of Computer and System Sciences, 1975
- Two-way a-transducers and AFLJournal of Computer and System Sciences, 1975
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974
- Controlled pushdown automataInformation Sciences, 1973
- Finite-turn checking automataJournal of Computer and System Sciences, 1971
- Chains of full AFL'sTheory of Computing Systems, 1970
- Quasi-realtime languagesTheory of Computing Systems, 1970
- The reduction of tape reversals for off-line one-tape Turing machinesJournal of Computer and System Sciences, 1968
- Control sets on grammarsTheory of Computing Systems, 1968