On domain and range tree languages of superlinear deterministic top-down tree transformations

Acta Cybernetica

Volumn 12, Issue 3, 1996, Pages 261-277

  Dányi, Gábor ^a  

^a UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347387200     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. Baker. B. S., Composition of top-down and bottom-up treetransductions, Information and Control, 41 (1979) 186-213.
2. Dányi, G. and Fülöp, Z., Superlinear Deterministic Top-down Tree Transducers, Mathematical Systems Theory, 29 (1996) 507-534.
3. Dányi, G. and Fülöp. Z., Compositions with Superlinear Deterministic Top-down Tree Transducers, Theoretical Computer Science, accepted for publication
4. Engelfriet, J., Bottom-up and top-down tree transformations - a comparison, Mathematical Systems Theory, 9 (1975) 198-231.
5. Engelfriet, J., Top-down tree transducers with regular look-ahead, Mathematical Systems Theory, 10 (1977) 289-303.
6. Fülöp, Z. and Vágvölgyi, S., Results on compositions of deterministic root-to-frontier tree transformations, Acta Cybernetica, 8 (1987) 49-61.
7. Gécseg, F. and Steinby, M., Tree Automata, Akadémiai Kiadó, Budapest, 1984.
8. Gécseg, F. and Steinby, M., Minimal ascending tree automata, Acta Cybernetica, 4 (1980) 37-44.
9. Rounds, W. C., Mappings on grammars and trees, Mathematical Systems Theory, 4 (1970) 257-287.