Two-way deterministic multi-weak-counter machines
From MaRDI portal
Publication:1165028
DOI10.1016/0304-3975(82)90086-XzbMath0486.68085MaRDI QIDQ1165028
Publication date: 1982
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
On two-way weak counter machines ⋮ GENERALIZED COUNTERS AND REVERSAL COMPLEXITY ⋮ Interference automata ⋮ Remarks on two-way automata with weak-counters
Cites Work
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Simple counter machines and number-theoretic problems
- A note on semilinear sets and bounded-reversal multihead pushdown automata
- On tape-bounded complexity classes and multihead finite automata
- Remarks on the complexity of nondeterministic counter languages
- Finite automata with multiplication
- Remarks on blind and partially blind one-way multicounter machines
- Restricted one-counter machines with undecidable universe problems
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Bounded-reversal multihead finite automata languages
- On Context-Free Languages
- Two-way pushdown automata
- Counter machines and counter languages
- Multi-stack-counter languages
This page was built for publication: Two-way deterministic multi-weak-counter machines
