Visibly Pushdown Transducers

  • Jean-François Raskin
  • Frédéric Servais
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5126)


Visibly pushdown automata have been recently introduced by Alur and Madhusudan as a subclass of pushdown automata. This class enjoys nice properties such as closure under all Boolean operations and the decidability of language inclusion. Along the same line, we introduce here visibly pushdown transducers as a subclass of pushdown transducers. We study properties of those transducers and identify subclasses with useful properties like decidability of type checking as well as preservation of regularity of visibly pushdown languages.


Regular Language Parallel Simulation Type Check Tree Transducer Deterministic Polynomial Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abdulla, P., Legay, A., d’Orso, J., Rezine, A.: Tree regular model checking: A simulation-based approach. J. Log. Algebr. Program. 69(1-2), 93–121 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Alur, R.: Marrying words and trees. In: PODS, pp. 233–242 (2007)Google Scholar
  3. 3.
    Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202–211 (2004)Google Scholar
  4. 4.
    Alur, R., Madhusudan, P.: Adding nesting structure to words. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 1–13. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: CAV, pp. 403–418 (2000)Google Scholar
  6. 6.
    Fisman, D., Pnueli, A.: Beyond regular model checking. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 156–170. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  7. 7.
    Maneth, S., Berlea, A., Perst, T., Seidl, H.: XML type checking with macro tree transducers. In: PODS, pp. 283–294 (2005)Google Scholar
  8. 8.
    Martens, W., Neven, F.: Typechecking top-down uniform unranked tree transducers. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 64–78. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. In: PODS, pp. 11–22 (2000)Google Scholar
  10. 10.
    Raskin, J.-F., Servais, F.: Visibly pushdown transducers. Technical Report 2008.100, Federated Center for Verification - Université Libre de Bruxelles (2008),
  11. 11.
    Thomo, A., Venkatesh, S., Ying Ye, Y.: Visibly pushdown transducers for approximate validation of streaming XML. In: FoIKS, pp. 219–238 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jean-François Raskin
    • 1
  • Frédéric Servais
    • 2
  1. 1.Computer Science Department  
  2. 2.Department of Computer & Decision Engineering (CoDE)Université Libre de Bruxelles (U.L.B.) 

Personalised recommendations