scientific article; zbMATH DE number 2040920
From MaRDI portal
Publication:4452076
Recommendations
Cited in
(9)- Flip-pushdown automata with \(k\) pushdown reversals and E0L systems are incomparable
- A pumping lemma for flip-pushdown languages
- Deterministic Input-Reversal and Input-Revolving Finite Automata
- scientific article; zbMATH DE number 3976379 (Why is no real title available?)
- scientific article; zbMATH DE number 2038733 (Why is no real title available?)
- On store languages of language acceptors
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- On store languages and applications
- Queue Automata: Foundations and Developments
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452076)