Self-verifying pushdown and queue automata
From MaRDI portal
Publication:5164866
DOI10.3233/FI-2021-2032OpenAlexW3163498776MaRDI QIDQ5164866FDOQ5164866
Authors: Henning Fernau, Martin Kutrib, Matthias Wendlandt 
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
Recommendations
- Self-verifying finite automata and descriptional complexity
- Computational complexity of decision problems on self-verifying finite automata
- Optimal simulation of self-verifying automata by deterministic automata
- Converting Self-verifying Automata into Deterministic Automata
- Unary Self-verifying Symmetric Difference Automata
Cites Work
- Fundamentals of parameterized complexity
- Pushdown automata with bounded nondeterminism and bounded ambiguity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parameterized algorithms
- Title not available (Why is that?)
- QRT FIFO automata, breadth-first grammars and their relations
- A regularity test for pushdown machines
- Descriptional complexity -- an introductory survey
- On Goedel speed-up and succinctness of language representations
- Title not available (Why is that?)
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Title not available (Why is that?)
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
- Real-time computations with restricted nondeterminism
- Optimal simulation of self-verifying automata by deterministic automata
- Nondeterministic Communication with a Limited Number of Advice Bits
- One-way multihead writing finite automata
- On strongly context-free languages
- Queue Automata: Foundations and Developments
- One-time nondeterministic computations
Cited In (9)
- Self-verifying Cellular Automata
- Input-Driven Queue Automata with Internal Transductions
- Boolean kernels of context-free languages
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Iterative arrays with self-verifying communication cell
- Operations on Self-Verifying Finite Automata
- Self-verifying cellular automata
- Iterative arrays with self-verifying communication cell
- Queue Automata: Foundations and Developments
This page was built for publication: Self-verifying pushdown and queue automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164866)
