Formal series over sorted algebras

Discrete Mathematics

Volumn 254, Issue 1-3, 2002, Pages 231-258

  Kuich, Werner ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 31244431610     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00294-1     Document Type: Article

References (30)

1. H. Bekic, Definable operations in general algebras, and the theory of automata and flowcharts, Technical Report, IBM Labor, Wien, 1967.
2. J. Berstel, C. Reutenauer, Recognizable formal power series on trees, Theoret. Comput. Sci. 18 (1982) 115-148.
3. S. Bozapalidis, Equational elements in additive algebras, Theory Comput. Systems 32 (1999) 1-33.
4. N. Chomsky, M.P. Schützenberger, The algebraic theory of context-free languages, in: P. Braffort, D. Hirschberg (Eds.), Computer Programming and Formal Systems, North-Holland, Amsterdam, 1963, pp. 118-161.
5. R. Cori, J. Richard, Enumeration des graphes planaires à l'aide des series formelles en variables noncommutatives, Discrete Math. 2 (1972) 115-162.
6. B. Courcelle, Equivalences and transformations of regular systems-applications to recursive program schemes and grammars, Theoret. Comp. Sci. 42 (1986) 1-122.
7. B. Courcelle, Basic notions of universal algebra for language theory and graph grammars, Theoret. Comput. Sci. 163 (1996) 1-54.
8. Z. Ésik, W. Kuich, A Kleene theorem for Lindenmayerian algebraic power series, J. Automata, Languages Combin. 5 (2000) 109-122.
9. F. Gécseg, M. Steinby, Tree languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 3, Springer, Berlin, 1997, pp. 1-68 (Chapter 1).
10. S. Ginsburg, H.G. Rice, Two families of languages related to ALGOL, J. Assoc. Comput. Mach. 9 (1962) 350-371.
11. M. Goldstern, Vervollständigung von Halbringen, Diplomarbeit, Technische Universität Wien, 1985.
12. M. Gross, A. Lentin, Introduction to Formal Grammars, Springer, Berlin, 1970.
13. J. Gruska, A characterization of context-free languages, J. Comput. System Sci. 5 (1971) 353-364.
14. F. Harary, G. Prins, W.T. Tutte, The number of plane trees, Indag. Math. 26 (1964) 319-329.
15. G. Karner, On limits in complete semirings, Semigroup Forum 45 (1992) 148-165.
16. D.A. Klarner, Correspondences between plane trees and binary sequences, J. Comb. Theory 9 (1970) 401-411.
17. St.C. Kleene, Representation of events in nerve nets and finite automata, in: C.E. Shannon, J. McCarthy (Eds.), Automata Studies, Princeton University Press, Princeton, 1956, pp. 3-41.
18. W. Kuich, Über die Entropie kontext-freier Sprachen, Habilitationsschrift, Technische Hochschule Wien, 1970. (English translation: On the entropy of context-free languages, Inf. Control 16 (1970) 173-200.)
19. W. Kuich, Languages and the enumeration of planted plane trees, Indag. Math. 32 (1970) 268-280.
20. W. Kuich, Semirings and formal power series: their relevance to formal languages and automata theory, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, Springer, Berlin, 1997, pp. 609-677 (Chapter 9).
21. W. Kuich, Formal power series over trees, in: S. Bozapalidis (Ed.), Proceedings of the Third International Conference Developments in Language Theory, Aristotle University of Thessaloniki, 1998, pp. 61-101.
22. W. Kuich, Gaußian elimination and a characterization of algebraic power series, MFCS 98, Lecture Notes in Computer Science, Vol. 1450, Springer, Berlin, 1998, pp. 512-521.
23. W. Kuich, Formal series over algebras, MFCS 2000, Lecture Notes in Computer Science, Vol. 1983, Springer, Berlin, 2000, pp. 488-496.
24. W. Kuich, A. Salomaa, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science, Vol. 5, Springer, Berlin, 1986.
25. J. Mezei, J.B. Wright, Algebraic automata and context-free sets, Inf. Control 11 (1967) 3-29.
26. A. Salomaa, Formal Languages, Academic Press, New York, 1973.
27. A. Salomaa, M. Soittola, Automata-theoretic aspects of formal power series, Springer, Berlin, 1978.
28. M.P. Schützenberger, Certain elementary families of automata, in: Proceedings of the Symposium on Mathematical Theory of Automata, Polytechnic Institute of Brooklyn, 1962, pp. 139-153.
29. R.P. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge University Press, Cambridge, 1999.
30. W. Wechler, Universal Algebra for Computer Scientists, EATCS Monographs on Computer Science, Vol. 25, Springer, Berlin, 1992.