scientific article; zbMATH DE number 7168150

MaRDI QIDQ5216306

Olivier Gauwin, Anca Muscholl, Michael Raskin

Publication date: 17 February 2020

Full work available at URL: https://arxiv.org/abs/1907.09563

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

minimizationvisibly pushdown automata

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

Simulation relations and applications in formal methods

Cites Work

• Unnamed Item
• Unnamed Item
• The tractability frontier for NFA minimization
• Minimizing finite automata is computationally hard
• On the minimization of XML schemas and tree automata for unranked trees
• Minimization of Visibly Pushdown Automata Using Partial Max-SAT
• Minimizing Variants of Visibly Pushdown Automata
• Visibly pushdown languages
• Automata, Languages and Programming
• Minimization, Learning, and Conformance Testing of Boolean Programs

This page was built for publication: