Visibly Pushdown Languages and Term Rewriting

  • Jacques Chabin
  • Pierre Réty
Conference paper

DOI: 10.1007/978-3-540-74621-8_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4720)
Cite this paper as:
Chabin J., Réty P. (2007) Visibly Pushdown Languages and Term Rewriting. In: Konev B., Wolter F. (eds) Frontiers of Combining Systems. FroCoS 2007. Lecture Notes in Computer Science, vol 4720. Springer, Berlin, Heidelberg

Abstract

To combine tree languages with term rewriting, we introduce a new class of tree languages, that both extends regular languages and restricts context-free languages, and that is closed under intersection (unlike context-free languages). To do it, we combine the concept of visibly pushdown language, with top-down pushdown tree automata, and we get the visibly pushdown tree automata. Then, we use them to express the sets of descendants for a sub-class of growing term rewrite systems, and thanks to closure under intersection, we get that joinability and (restricted) unifiability are decidable.

Keywords

tree languages term rewriting 

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

  • Jacques Chabin
    • 1
  • Pierre Réty
    • 1
  1. 1.LIFO - Université d’Orléans, B.P. 6759, 45067 Orléans cedex 2France

Personalised recommendations