Minimizing Variants of Visibly Pushdown Automata

  • Patrick Chervet
  • Igor Walukiewicz
Conference paper

DOI: 10.1007/978-3-540-74456-6_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4708)
Cite this paper as:
Chervet P., Walukiewicz I. (2007) Minimizing Variants of Visibly Pushdown Automata. In: Kučera L., Kučera A. (eds) Mathematical Foundations of Computer Science 2007. MFCS 2007. Lecture Notes in Computer Science, vol 4708. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Patrick Chervet
    • 1
  • Igor Walukiewicz
    • 1
  1. 1.LaBRI, Université de Bordeaux and CNRS, 351, Cours de la Libération, F-33 405, Talence cedexFrance

Personalised recommendations