Tinput-driven pushdown, counter, and stack automata
From MaRDI portal
Publication:4601148
DOI10.3233/FI-2017-1576zbMATH Open1378.68107MaRDI QIDQ4601148FDOQ4601148
Authors: Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Publication date: 19 January 2018
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Recommendations
Cited In (14)
- Input-driven queue automata: finite turns, decidability, and closure properties
- Digging input-driven pushdown automata
- Input-driven double-head pushdown automata
- Edit distance neighbourhoods of input-driven pushdown automata
- On the power of pushing or stationary moves for input-driven pushdown automata
- Input-driven stack automata
- Tree-walking-storage automata
- On the power of pushing or stationary moves for input-driven pushdown automata
- Beyond operator-precedence grammars and languages
- Exact descriptional complexity of determinization of input-driven pushdown automata
- Tinput-Driven Pushdown Automata
- Input-Driven Double-Head Pushdown Automata
- Input-driven multi-counter automata
- Input-driven multi-counter automata
This page was built for publication: Tinput-driven pushdown, counter, and stack automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601148)