Domains of partial attributed tree transducers

Information Processing Letters

Volumn 73, Issue 5, 2000, Pages 175-180

  Fülöp, Zoltán ^a   Maneth, Sebastian ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL GRAMMARS; THEOREM PROVING; TREES (MATHEMATICS);

PARTIAL ATTRIBUTED TREE TRANSDUCERS (PATT); TREE WALKING AUTOMATA;

FORMAL LANGUAGES;

EID: 0342323807     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00028-4     Document Type: Article

References (10)

1. Aho A.V., Ullman J.D. Translations on a context-free grammar. Inform. and Control. Vol. 19:1971;439-475.
2. Bartha M. An algebraic definition of attributed transformations. Gécseg F. Proc. FCT'81. Lecture Notes in Comput. Sci. Vol. 117:1981;51-60 Springer, Berlin.
3. Engelfriet J., Hoogeboom H.J., van Best J.-P. Trips on trees. Acta Cybernet. Vol. 14:1999;51-64.
4. Fülöp Z., Herrmann F., Vágvölgyi S., Vogler H. Tree transducers with external functions. Theoret. Comput. Sci. Vol. 108:1993;185-236.
5. Fülöp Z. On attributed tree transducers. Acta Cybernet. Vol. 5:1981;261-279.
6. Fülöp Z., Vogler H. Syntax-Directed Semantics - Formal Models based on Tree Transducers. W. Brauer, G. Rozenberg, A. Salomaa (Eds.) EATCS Monographs on Theoretical Computer Science. 1998;Springer, Berlin.
7. Gécseg F., Steinby M. Tree Automata. 1984;Akadémiai Kiadó Budapest.
8. Kamimura T. Tree automata and attribute grammars. Inform. and Control. Vol. 57:1983;1-20.
9. Knuth D.E. Semantics of context-free languages. Math. Systems Theory. Vol. 2:1968;127-145. (Corrections in Math. Systems Theory 5 (1971) 95-96.).
10. F. Neven, T. Schwentick, On the Power of Tree-Walking Automata, In preperation.