Set automata
From MaRDI portal
Recommendations
Cites work
- k + 1 Heads Are Better than k
- A regularity test for pushdown machines
- 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
- One-way stack automata
- QRT FIFO automata, breadth-first grammars and their relations
- Regularity and Related Problems for Deterministic Pushdown Automata
- \(L(A)=L(B)\)? decidability results from complete formal systems
Cited in
(14)- One-way reversible multi-head finite automata
- scientific article; zbMATH DE number 5593273 (Why is no real title available?)
- On emptiness and membership problems for set automata
- Second-order finite automata
- Regularity and size of set automata
- On computational complexity of set automata
- On computational complexity of set automata
- String assembling systems: origins and directions
- On store languages and applications
- Real-time, constant-space, constant-randomness verifiers
- Real-time, constant-space, constant-randomness verifiers
- Automata equipped with auxiliary data structures and regular realizability problems
- Deterministic set automata
- The bag automaton: a model of nondeterministic storage
This page was built for publication: Set automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2814837)
