Abstract
We generalize the characterization of abstract families of languages by abstract families of acceptors to continuous semirings: Abstract families of elements are now characterized by automata representing a certain type.
Preview
Unable to display preview. Download preview PDF.
References
Berstel, J.: Transductions and Context-Free Languages. Teubner, 1979.
Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland, 1975.
Goldstern, M.: Vervollständigung von Halbringen. Diplomarbeit, Technische Universität Wien, 1985.
Karner, G.: On limits in complete semirings. Semigroup Forum 45(1992) 148–165.
Kuich, W.: The algebraic equivalent of AFL theory. ICALP95, Lect. Notes Comput. Sci. 944(1995) 39–50.
Kuich, W.: Semirings and formal power series: Their relevance to formal languages and automata theory. In: G. Rozenberg and A. Salomaa, eds., Handbook of Formal Languages. Springer, to appear.
Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, Vol. 5. Springer, 1986.
Sakarovitch, J.: Kleene's theorem revisited. Lect. Notes Comput. Sci. 281(1987) 39–50.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Karner, G., Kuich, W. (1997). On abstract families of languages, power series, and elements. In: Freksa, C., Jantzen, M., Valk, R. (eds) Foundations of Computer Science. Lecture Notes in Computer Science, vol 1337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052080
Download citation
DOI: https://doi.org/10.1007/BFb0052080
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63746-2
Online ISBN: 978-3-540-69640-7
eBook Packages: Springer Book Archive