Visits, crosses, and reversals for nondeterministic off-line machines
Open Access
- 28 February 1978
- journal article
- Published by Elsevier in Information and Control
- Vol. 36 (2) , 174-216
- https://doi.org/10.1016/s0019-9958(78)90289-9
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Time- and tape-bounded turing acceptors and AFLsJournal of Computer and System Sciences, 1970
- A characterization of two-way deterministic classes of languagesJournal of Computer and System Sciences, 1970
- Principal AFLJournal of Computer and System Sciences, 1970
- Quasi-realtime languagesTheory of Computing Systems, 1970
- Checking automata and one-way stack languagesJournal of Computer and System Sciences, 1969
- Counter machines and counter languagesTheory of Computing Systems, 1968
- The reduction of tape reversals for off-line one-tape Turing machinesJournal of Computer and System Sciences, 1968
- Stack automata and compilingJournal of the ACM, 1967