Gaußian elimination and a characterization of algebraic power series

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1450 LNCS, Issue , 1998, Pages 512-521

  Kuich, Werner ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CHARACTERIZATION;

POWER SERIES; SEMI-RING; SYSTEMS OF EQUATIONS;

CONTEXT FREE LANGUAGES;

EID: 84896693413     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055801     Document Type: Conference Paper

References (16)

1. Autebert, J.-M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Handbook of Formal Languages (Eds.: G. Rozenberg and A. Salomaa), Springer, 1997, vol. 1, Chapter 3, 111-174.
2. Bekic, H.: Definable operations in general algebras, and the theory of automata and flowcharts. Tech. Report, IBM Labor, Wien, 1967.
3. Bozapalidis, S.: Equational elements in additive algebras. Technical Report, Aristotle University of Thessaloniki, 1997.
4. Esik, Z.: Completeness of Park induction. Theor. Comput. Sci. 177 (1997) 217-283.
5. Gecseg, 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. Goldstern, M.: Vervollständigung von Halbringen. Diplomarbeit, Technische Universität Wien, 1985.
7. Gruska, J.: A characterization of context-free languages. Journal of Computer and System Sciences 5 (1971) 353-364.
8. Karner, G.: On limits in complete semirings. Semigroup Forum 45 (1992) 148-165.
9. Kuich, W.: The Kleene and the Parikh theorem in complete semirings. ICALP87, Lect. Notes Comput. Sci. 267(1987) 212-225.
10. 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.
11. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, Vol. 5. Springer, 1986.
12. Lausch, H., Nöbauer, W.: Algebra of Polynomials. North-Holland, 1973.
13. Sakarovitch, J.: Kleene's theorem revisited. Lect. Notes Comput. Sci. 281(1987) 39-50.
14. Salomaa, A.: Formal Languages. Academic Press, 1973.
15. Thatcher, J. W., Wright, J. B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory 2(1968) 57-81.
16. Wechler, W.: Universal Algebra for Computer Scientists. EATCS Monographs on Computer Science, Vol. 25. Springer, 1992.