Context-free series on trees

Information and Computation

Volumn 169, Issue 2, 2001, Pages 186-229

  Bozapalidis, Symeon ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; POLYNOMIALS; RECURSIVE FUNCTIONS; THEOREM PROVING;

CONTEXT-FREE SERIES;

TREES (MATHEMATICS);

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

References (25)

1. [AD1] Arnold, A., and Dauchet, M. (1976), Un théorem de duplication pour les forêts algebriques, J. Comput. System Sci. 13, 223-244.
2. [AD2] Arnold, A., and Dauchet, M. (1978), Forêts algebriques et homororphismes inverses, Inform. and Comput. 37, 182-196.
3. [AN1] Arnold, A., and Nivat, M. (1977), Non deterministic program scheme, in "FTC'77" (M. Kaprmski, Ed.), SLN 56, 12-21.
4. [AN2] Arnold, A., and Nivat, M. (1980), Formal computations of formal non deterministic recursive program schemes, MST 13, 219-236.
5. [Ar] Arnold, A. (1977), "Systemes d' equations dans les magmoï des: Ensembles rationels et algebrigues," Thése d' état, Lille.
6. [BA] Bozapalidis, S., and Alexandrakis, A. (1989), Representations matricielles des series des arbres reconnaisables, RAIRO Inform. Theor. Appl. 23, 449-459.
7. [BE] Bloom, S., and Ésik, Z. (1991), "Iteration Theories," Springer-Verlag, Berlin/New York.
8. [Be] Békiç, H. (1969), "Definable Operations in General Algebras and the Theory of Automata and Flowcharts," IBM Laboratories, Vienna.
9. [Bo1] Bozapalidis, S. (1992), Alphabetic tree relations, Theoret. Comput. Sci. 99, 177-204.
10. [Bo2] Bozapalidis, S. (1994), Representable tree series, Fund. Inform. 21, 367-389.
11. [Bo3] Bozapalidis, S. (1999), Equational elements in additive algebras, Theory Comput. Syst. 32, 1-33.
12. [BR1] Berstel, J., and Reutenauer, C. (1982), Recognizable formal power series on trees, Theoret. Comput. Sci. 18, 115-142.
13. [BR2] Berstel, J., and Reutcnauer, C. (1984), "Les series reconnaisables et leurs languages," Masson, Paris.
14. [En1] Engelfriet, J. "Simple Program Schemes and Formal Languages," Lecture Notes in Computer Science, Vol. 20, Springer-Verlag, Berlin/New York.
15. [En2] Engelfriet, J. (1975), "Tree Automata and Tree Grammars," DIAMI FN, Vol. 10.
16. [ES] Engelfriet, J., and Schmidt, E.-M. (1978), IO and OI, I and II, J. Comput. System Sci. 15/16.
17. [GR] Ginsburg, S., and Rice, G. (1962), Two families of languages related to ALGOL, J. Assoc. Comput. Mach. 9, 350-371.
18. [GS] Gecseg, F., and Steinby, M. (1997), "Handbook of Formal Languages," Vol. 3, pp. 1-68, Springer-Verlag, Berlin Heidelberg.
19. [KB] Kolman, B., and Busby, R. (1987), "Discrete Mathematical Structures for Computer Sciences," Prentice Hall, New York.
20. [KS] Kuich, W., and Salomaa, A. (1986), "Semirings, Automata, Languages," Springer-Verlag, Berlin/New York.
21. [Ku1] Kuich, W. (1996), Semirings and formal power series: Their relevance to formal languages and automata, in "Handbook of Formal Languages" (G. Rozenberg and A. Salomaa, Eds.), Springer-Verlag, Berlin/New York.
22. [Ku2] Kuich, W. (1997), Formal power series on trees, preprint.
23. [MA] Manes, E., and Arbib, M. (1986), "Algebraic Approaches to Program Semantics," Springer-Verlag, Berlin/New York.
24. [Se] Seild, H. (1989), Deciding equivalence of finite tree automata, "STACS' 88," Lecture Notes in Computer Science, Vol. 349, pp. 48-492, Springer Verlag, Berlin/New York.
25. [SS] Salomaa, A., and Soittola, A. (1977), "Automata-Theoretic Aspects of Formal Power Series," Springer-Verlag, Berlin/New York.