The minimization problem for visibly pushdown automata (VPA) is studied. Two subclasses of VPA are introduced: call driven automata, and block automata. For the first class, minimization results are given unifying and generalizing those present in the literature. Unfortunately, this class shares the drawback of all other classes for which a minimization result is known: it is exponentially less succinct than VPA. The second class, block automata, is introduced to address this problem. These automata are as succinct as VPA. A minimization procedure for them is presented that requires one additional parameter to be fixed. An example of an exponential gain in succinctness is given. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Chervet, P., & Walukiewicz, I. (2007). Minimizing variants of visibly pushdown automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4708 LNCS, pp. 135–146). Springer Verlag. https://doi.org/10.1007/978-3-540-74456-6_14
Mendeley helps you to discover research relevant for your work.