Set Automata
From MaRDI portal
Publication:2814837
DOI10.1142/S0129054116400062zbMath1352.68134OpenAlexW4231358735MaRDI QIDQ2814837
Andreas Malcher, Martin Kutrib, Matthias Wendlandt
Publication date: 23 June 2016
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054116400062
Related Items (6)
One-way reversible multi-head finite automata ⋮ Real-time, constant-space, constant-randomness verifiers ⋮ On store languages and applications ⋮ Real-time, constant-space, constant-randomness verifiers ⋮ On computational complexity of set automata ⋮ Automata equipped with auxiliary data structures and regular realizability problems
Cites Work
- QRT FIFO automata, breadth-first grammars and their relations
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- On certain formal properties of grammars
- On the Succinctness of Different Representations of Languages
- Regularity and Related Problems for Deterministic Pushdown Automata
- k + 1 Heads Are Better than k
- A regularity test for pushdown machines
- One-way stack automata
This page was built for publication: Set Automata
