Equational elements in additive algebras

Theory of Computing Systems

Volumn 32, Issue 1, 1999, Pages 1-33

  Bozapalidis, S ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

FORMAL POWER SERIES; GAMMA-ALGEBRA; KLEENE'S THEOREM; LINEAR FUNCTIONS; MATHEMATICAL LANGUAGES; RECOGNIZABLE SERIES; SEMI-RING; SEMIALGEBRA;

ALGEBRA;

EID: 0033483408     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000110     Document Type: Article

References (18)

1. Berstel, J., and Reutenauer, C.: Recognizable formal power series on trees, Theoret. Comput. Sci., 18 (1982), 115-142.
2. Courcelle, B.: On recognizable sets and tree automata, in Resolution of Equations in Algebraic Structures (H. Ait-Kaci and M. Nivat, eds.), Academic Press, New York (1989).
3. Courcelle, B.: Equivalences and transformations of regular systems: applications to recursive program schemes and grammars, Theoret. Comput. Sci., 42 (1986), 1-22.
4. Dubinski, A.: Computation on arbitrary algebras, in λ-Calculus and Science Theory, LNCS 37, Springer-Verlag, Berlin (1975), pp. 319-341.
5. Eilenberg, S.: Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974.
6. Engelfriet, J.: Tree Automata and Tree Grammars, DIAMI FN-10 (1975).
7. Engelfriet, J., and Schmidt, E.-M: IO and OI I, J. Comput. System Sci., 15(3) (1977).
8. Gruska, J.: A characterization of context-free languages, J. Comput. Sci., 5 (1971), 353-364.
9. Gecseg, F., and Steinby, M.: Tree Automata, Akademiai Kiado, Budapest (1984).
10. Gecseg, F., and Steinby, M.: Tree languages, in: Handbook of Formal Languages (G. Rozenberg and A. Salomaa, eds.), Springer-Verlag, New York, vol. 3, pp. 1-68.
11. Goguen, J. A., Thatcher, J. W., Wagner, E. G., and Wright, J. B.: Initial algebra semantics, J. Assoc. Comput. Mach., 24 (1977), 68-95.
12. Karner, G.: On limits in complete semirings, Semigroup Forum, 45 (1992), 148-165.
13. Kuich, W.: 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, New York (1997).
14. Manes, E., and Arbib, M.: Algebraic Approaches to Programm Semantics, Springer-Verlag, New York (1986).
15. Mezei, J., and Wright, J. B.: Algebraic automata and context free sets, Inform. and Control, 11 (1967), 3-29.
16. Seidl, H.: Deciding equivalence of finite tree automata. Proc. STACS 88, LNCS 349, Springer-Verlag, Berlin (1989), pp. 480-492.
17. Salomaa, A., and Soittola, M.: Automata-Theoretic Aspects of Formal Power Series, Springer-Verlag, New York (1977).
18. Wechler, W.: Universal Algebra for Computer Scientists, Springer-Verlag, New York (1992).