Skip to main content
SpringerLink
Log in

Formal Series over Algebras

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2000 (MFCS 2000)

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

Abstract

We define two types of series over Σ-algebras: formal series and, as a special case, term series. By help of term series we define systems (of equations) that have tuples of formal series as solutions. We then introduce finite automata and polynomial systems and show that they are mechanisms of equal power. Morphisms from formal series into power series yield combinatorial results.

Partially supported by Wissenschaftlich-Technisches Abkommen Ősterreich-Ungarn.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bozapalidis, S.: Equational elements in additive algebras. Theory Comput. Systems 32(1999) 1–33.

    Article  MATH  MathSciNet  Google Scholar 

  2. Courcelle, B.: Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars. Theor. Comp. Sci. 42(1986) 1–122.

    Article  MATH  MathSciNet  Google Scholar 

  3. Courcelle, B.: Basic notions of universal algebra for language theory and graph grammars. Theoretical Computer Science 163(1996) 1–54.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  5. Harary F., Prins G., Tutte W. T.: The number of plane trees. Indagationes Mathematicae 26(1964) 319–329.

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Klarner D. A.: Correspondences between plane trees and binary sequences. J. Comb. Theory 9(1970) 401–411.

    Article  MATH  MathSciNet  Google Scholar 

  8. Kuich, W.: Uber 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.

    Google Scholar 

  9. Kuich, W.: Languages and the enumeration of planted plane trees. Indagationes Mathematicae 32(1970) 268–280.

    MathSciNet  Google Scholar 

  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.

    Google Scholar 

  11. Kuich, W.: Formal power series over trees. In: Proceedings of the 3rd International Conference Developments in Language Theory S. Bozapalidis, ed., Aristotle University of Thessaloniki, 1998, pp. 61–101.

    Google Scholar 

  12. Kuich, W.: Pushdown tree automata, algebraic tree systems and algebraic tree series. Information and Computation, to appear.

    Google Scholar 

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

    Google Scholar 

  14. Mezei, J., Wright, J. B.: Algebraic automata and context-free sets. Inf. Control 11(1967) 3–29.

    Article  MATH  MathSciNet  Google Scholar 

  15. Stanley, R. P.: Enumerative Combinatorics, Volume 2. Cambridge University Press, 1999.

    Google Scholar 

  16. Wechler, W.: Universal Algebra for Computer Scientists. EATCS Monographs on Computer Science, Vol. 25. Springer, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Wien, Wiedner Hauptstraße 8-10, A-1040, Wien

    Werner Kuich

Authors
  1. Werner Kuich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Aarhus, Ny Munkegade, Bldg. 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

  2. Department of Computer Sciene, Comenius University, 84248, Bratislava, Slovakia

    Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuich, W. (2000). Formal Series over Algebras. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-44612-5_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67901-1

  • Online ISBN: 978-3-540-44612-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation