Real-time computations with restricted nondeterminism
From MaRDI portal
Publication:4197340
DOI10.1007/BF01776575zbMATH Open0409.68027MaRDI QIDQ4197340FDOQ4197340
Authors: Patrick C. Fischer, Chandra M. R. Kintala 
Publication date: 1979
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Computational ComplexityLanguages Acceptable By Real-Time Multitape Turing MachinesReal-Time Definable Languages
Cites Work
- On the Computational Complexity of Algorithms
- The complexity of theorem-proving procedures
- Quasi-realtime languages
- Title not available (Why is that?)
- Turing machines with restricted memory access
- Classes of languages and linear-bounded automata
- Real-Time Simulation of Multihead Tape Units
- Title not available (Why is that?)
- Real-Time Definable Languages
- Title not available (Why is that?)
Cited In (15)
- Self-verifying pushdown and queue automata
- Regulated nondeterminism in pushdown automata
- Context-dependent nondeterminism for pushdown 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
- Shrinking one-way cellular automata
- Nondeterministics circuits, space complexity and quasigroups
- Measuring nondeterminism in pushdown 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)
