Skip to main content

A characterization of abstract families of algebraic power series

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1997 (MFCS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1295))

  • 96 Accesses

Abstract

Given a continuous semiring A and a collection \(\mathfrak{H}\) of semiring morphisms mapping the elements of A into finite matrices with entries in A we define \(\mathfrak{H}\)-closed semirings. These are fully rationally closed semi-rings that are closed under the following operation: each morphism in \(\mathfrak{H}\) maps an element of the ,\(\mathfrak{H}\)-closed semiring on a finite matrix whose entries are again in this \(\mathfrak{H}\)-closed semiring. \(\mathfrak{H}\)-closed semirings coincide under certain conditions with abstract families of elements. If they contain only algebraic elements over some A′, A\(\subseteq\) A, then they are characterized by \(\Re \mathfrak{a}\mathfrak{t}\)(A′)-algebraic systems of a specific form. The results are then applied to formal power series and formal languages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J.: Transductions and Context-Free Languages. Teubner, 1979.

    Google Scholar 

  2. Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland, 1975.

    Google Scholar 

  3. Goldstern, M.: Vervollständigung von Halbringen. Diplomarbeit, Technische Universität Wien, 1985.

    Google Scholar 

  4. Karner, G.: On limits in complete semirings. Semigroup Forum 45 (1992) 148–165.

    Google Scholar 

  5. Karner, G., Kuich, W.: On abstract families of languages, power series, and elements. Lect. Notes Comput. Sci., to appear.

    Google Scholar 

  6. Kuich, W.: Matrix systems and principal cones of algebraic power series. MFCS 86, Lect. Notes Comput. Sci. 233 (1986) 512–517 and Theoret. Comput. Sci. 57(1988) 147–152.

    Google Scholar 

  7. Kuich, W.: The algebraic equivalent of AFL theory. ICALP95, Lect. Notes Comput. Sci. 944 (1995) 39–50.

    Google Scholar 

  8. 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, 1997, 609–677.

    Google Scholar 

  9. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, Vol. 5. Springer, 1986.

    Google Scholar 

  10. Lausch, H., Nöbauer, W.: Algebra of Polynomials. North Holland, 1973.

    Google Scholar 

  11. Sakarovitch, J.: Kleene's theorem revisited. Lect. Notes Comput. Sci. 281 (1987) 39–50.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Igor Prívara Peter Ružička

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karner, G., Kuich, W. (1997). A characterization of abstract families of algebraic power series. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029976

Download citation

  • DOI: https://doi.org/10.1007/BFb0029976

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63437-9

  • Online ISBN: 978-3-540-69547-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics