Minimizing Variants of Visibly Pushdown Automata

DOI10.1007/978-3-540-74456-6_14MaRDI QIDQ3525563zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Minimization of visibly pushdown automata using partial Max-SAT
• Trimming visibly pushdown automata
• Automata, Languages and Programming
• Trimming visibly pushdown automata
• On Model Checking for Visibly Pushdown Automata

Cited in

(19)

• On the power of pushing or stationary moves for input-driven pushdown automata
• Trimming visibly pushdown automata
• Deterministic input-driven queue automata: finite turns, decidability, and closure properties
• State complexity of operations on input-driven pushdown automata
• Tinput-Driven Pushdown Automata
• When input-driven pushdown automata meet reversiblity
• Descriptional complexity of input-driven pushdown automata
• Minimization of visibly pushdown automata using partial Max-SAT
• State Complexity of Nested Word Automata
• Descriptional complexity of unambiguous input-driven pushdown automata
• Digging input-driven pushdown automata
• Minimization of visibly pushdown automata is NP-complete
• Trimming visibly pushdown automata
• Limitations of lower bound methods for deterministic nested word automata
• Automata, Languages and Programming
• Minimization, Learning, and Conformance Testing of Boolean Programs
• On the power of pushing or stationary moves for input-driven pushdown automata
• Sweeping input-driven pushdown automata
• Sweeping input-driven pushdown automata

This page was built for publication: Minimizing Variants of Visibly Pushdown Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525563)