Visibly pushdown languages and term rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4720 LNAI, Issue , 2007, Pages 252-266

  Chabin, Jacques ^a   Réty, Pierre ^a  

^a UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

Term rewriting; Tree languages

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; CONTEXT FREE LANGUAGES; TREES (MATHEMATICS);

TERM REWRITING; TOP-DOWN PUSHDOWN TREE AUTOMATA; TREE LANGUAGES; VISIBLY PUSHDOWN LANGUAGE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 38049021499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74621-8_17     Document Type: Conference Paper

References (14)

1. Alur, R., Chaudhuri, S., Madhusudan, P.: Languages of Nested Trees. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, Springer, Heidelberg (2006)
2. Alur, R., Madhusudan, P.: Visibly Pushdown Languages. In: Proc. 36th ACM Symposium on Theory of Computing (STOC'04), pp. 202-211. ACM Press, New York (2004)
3. Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (TATA), http://www.grappa.univ- lille3.fr/tata
4. Genet, T., Klay, F.: Rewriting for cryptographic protocol verification. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, Springer, Heidelberg (2000) (extended version in Technical Report RR-3921, Inria 2000)
5. Gouranton, V., Réty, P., Seidl, H.: Synchronized Tree Languages Revisited and New Applications. In: Honsell, F., Miculan, M. (eds.) ETAPS 2001 and FOSSACS 2001. LNCS, vol. 2030, Springer, Heidelberg (2001)
6. Guessarian, I.: Pushdown Tree Automata. Mathematical Systems Theory 4(16), 237-263 (1983)
7. Hermann, M., Galbavý, R.: Unification of Infinite Sets of Terms Schematized by Primal Grammars. Theoretical Computer Science, 176 (1997)
8. Jacquemard, F.: Decidable approximations of term rewrite systems. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol. 1103, pp. 362-376. Springer, Heidelberg (1996)
9. Limet, S., Réty, P.: A New Result about the Decidability of the Existential One-Step Rewriting Theory. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, Springer, Heidelberg (1999)
10. Limet, S., Salzer, G.: Proving properties of term rewrite systems via logic programs. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 170-184. Springer, Heidelberg (2004)
11. Limet, S., Salzer, G.: Manipulating tree tuple languages by transforming logic programs. In: Dahn, I., Vigneron, L. (eds.) Electronic Notes in Theoretical Computer Science, vol. 86, Elsevier, Amsterdam (2003)
12. Lugiez, D., Schnoebelen, P.: The Regular Viewpoint on PA-Processes. Theoretical Computer Science (2000)
13. Nagaya, T., Toyama, Y.: Decidability for Left-Linear Growing Term Rewriting Systems. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, Springer, Heidelberg (1999)
14. Raoult, J.C.: Rational Tree Relations. Bulletin of the Belgian Mathematical Society Simon Stevin 4, 149-176 (1997)