Real-time computations with restricted nondeterminism
From MaRDI portal
Publication:4197340
Cites work
- scientific article; zbMATH DE number 3495593 (Why is no real title available?)
- scientific article; zbMATH DE number 3201659 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- Classes of languages and linear-bounded automata
- On the Computational Complexity of Algorithms
- Quasi-realtime languages
- Real-Time Definable Languages
- Real-Time Simulation of Multihead Tape Units
- The complexity of theorem-proving procedures
- Turing machines with restricted memory access
Cited in
(15)- Regulated nondeterminism in pushdown automata
- Context-dependent nondeterminism for pushdown automata
- Self-verifying pushdown and queue automata
- On multi-head automata with restricted nondeterminism
- Self-verifying Cellular Automata
- Regulated Nondeterminism in Pushdown Automata
- Computational power of one-way Turing machines with sublogarithmic memory restrictions
- Complexity of one-way cellular automata
- Nondeterministics circuits, space complexity and quasigroups
- Measuring nondeterminism in pushdown automata
- Shrinking one-way cellular automata
- In memoriam Chandra Kintala
- The emptiness problem for intersections of regular languages
- Iterative arrays with self-verifying communication cell
- Non-deterministic cellular automata and languages
This page was built for publication: Real-time computations with restricted nondeterminism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4197340)
