Minimizing Variants of Visibly Pushdown Automata
From MaRDI portal
Publication:3525563
DOI10.1007/978-3-540-74456-6_14zbMath1147.68555OpenAlexW2142746286MaRDI QIDQ3525563
Patrick Chervet, Igor Walukiewicz
Publication date: 17 September 2008
Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_14
Related Items (14)
Descriptional Complexity of Input-Driven Pushdown Automata ⋮ Unnamed Item ⋮ State complexity of operations on input-driven pushdown automata ⋮ On the power of pushing or stationary moves for input-driven pushdown automata ⋮ Tinput-Driven Pushdown Automata ⋮ Sweeping input-driven pushdown automata ⋮ When input-driven pushdown automata meet reversiblity ⋮ Descriptional complexity of unambiguous input-driven pushdown automata ⋮ Minimization of Visibly Pushdown Automata Using Partial Max-SAT ⋮ Limitations of lower bound methods for deterministic nested word automata ⋮ On the power of pushing or stationary moves for input-driven pushdown automata ⋮ State Complexity of Nested Word Automata ⋮ Deterministic input-driven queue automata: finite turns, decidability, and closure properties ⋮ Digging input-driven pushdown automata
This page was built for publication: Minimizing Variants of Visibly Pushdown Automata
