Positive Tree Representations and Applications to Tree Automata

Information and Computation

Volumn 139, Issue 2, 1997, Pages 130-153

  Bozapalidis, Symeon ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345984356     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2667     Document Type: Article

References (12)

1. Berstel, J., and Reutenauer, C. (1982), Recognizable formal power series on trees, Theoret. Comput. Sci. 18, 215-248.
2. Bozapalidis, S. Coalgebras and formal power series on trees, Submitted for publication.
3. Bozapalidis, S. (1994), Representable tree series, Fund. Inform. 21, 367-389.
4. Bozapalidis, S. (1991), Effective construction of the syntactic algebra of a recognizable series on trees, Acta Inform. 18, 251-263.
5. Bozapalidis, S., and Alexandrakis, A. (1989), Representation matricielles des séries d'arbres reconnaissables RAIRO, Inform. Theor. Appl. 23, 439-449.
6. Eilenberg, S. (1974), "Automata, Languages and Machines," Vol. A, Academic Press, New York.
7. Eilenberg, S. (1977), "Automata, Languages and Machines," Vol. B, Academic Press, New York.
8. Gass, S. I. (1985), "Linear Programming," 5th ed., McGraw-Hill, New York.
9. Gecseg, F., and Steinby, M. (1984), "Tree Automata," Akademiai Kiado, Budapest.
10. Paz, A. (1971), "Probabilistic Automata," Academic Press, New York.
11. Reutenauer, S. (1989), "Aspects Mathématiques des riseaux de Petri," Masson, Paris.
12. Salomaa, A., and Soittola, M. (1978), "Automata Theoretic Aspects of Formal Power Series," Springer-Verlag, Berlin/New York.