Minimization of visibly pushdown automata is NP-complete

Olivier Gauwin, Anca Muscholl, Michael Raskin. Minimization of visibly pushdown automata is NP-complete. Logical Methods in Computer Science, 16(1), 2020. [doi]

Abstract

Abstract is missing.