Self-Verifying Pushdown and Queue Automata
From MaRDI portal
Publication:5164866
DOI10.3233/FI-2021-2032OpenAlexW3163498776MaRDI QIDQ5164866
Matthias Wendlandt, Henning Fernau, Martin Kutrib
Publication date: 15 November 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2021-2032
Related Items
Iterative arrays with self-verifying communication cell ⋮ Iterative arrays with self-verifying communication cell ⋮ Boolean kernels of context-free languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Optimal simulation of self-verifying automata by deterministic automata
- On Goedel speed-up and succinctness of language representations
- QRT FIFO automata, breadth-first grammars and their relations
- Pushdown automata with bounded nondeterminism and bounded ambiguity
- On strongly context-free languages
- \(L(A)=L(B)\)? decidability results from complete formal systems
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
- One-time nondeterministic computations
- One-way multihead writing finite automata
- Real-time computations with restricted nondeterminism
- Nondeterministic Communication with a Limited Number of Advice Bits
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
- Queue Automata: Foundations and Developments
- Parameterized Algorithms
- A regularity test for pushdown machines
