Tree transducers and formal tree series

Acta Cybernetica

Volumn 14, Issue 1, 1999, Pages 135-149

  Kuich, Werner ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (10)

1. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theor. Comput. Sci. 18(1982) 115-148.
2. Bozapalidis, S.: Equational elements in additive algebras. Technical Report, Aristotle University of Thessaloniki, 1997.
3. Bozapalidis, S.: Context-free series on trees. Preprint, Aristotle University of Thessaloniki, February 1998.
4. Gécseg, F., Steinby, M.: Tree Automata. Akademiai Kiado, 1984.
5. Gécseg, F., Steinby, M.: Tree Languages. In: Handbook of Formal Languages (Eds.: G. Rozenberg and A. Salomaa), Springer, 1997, Vol. 3, Chapter 1, 1-68.
6. Kuich, W.: Semirings and formal power series: Their relevance to formal languages and automata theory. In: Handbook of Formal Languages (Eds.: G. Rozenberg and A. Salomaa), Springer, 1997, Vol. 1, Chapter 9, 609-677.
7. Kuich, W.: Formal power series over trees. In: Proceedings of the 3rd International Conference Developments in Language Theory (S. Bozapalidis, ed.), Aristotle University of Thessaloniki, 1998, 61-101.
8. Kuich, W.: Pushdown tree automata, algebraic tree systems, and algebraic tree series. Preprint, Technische Universität Wien, 1998.
9. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, Vol. 5. Springer, 1986.
10. 2 sequential machine maps. IBM Research Report RC 2466, 1969.