Skip to main content

On Power Series over a Graded Monoid

  • Chapter
  • First Online:
Computing with New Resources

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8808))

Abstract

We consider power series over a graded monoid \(M\) of finite type. We show first that, under certain conditions, the equivalence problem of power series over \(M\) with coefficients in the semiring \(\mathbb N\) of nonnegative integers can be reduced to the equivalence problem of power series over \(\{x\}^*\) with coefficients in \(\mathbb N\). This result is then applied to rational and recognizable power series over \(M\) with coefficients in \(\mathbb N\), and to rational power series over \(\Sigma ^*\) with coefficients in the semiring \(\mathbb {Q}_+\) of nonnegative rational numbers, where \(\Sigma \) is an alphabet.

Partially supported by grant no. K 108448 from the National Foundation of Hungary for Scientific Research.

Partially supported by Austrian Science Fund (FWF): grant no. I1661-N25.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Gruska, J.: Foundations of Computing. Thomson Learning (1997)

    Google Scholar 

  2. Harju, T., Karhumäki, J.: The equivalence problem of multitape finite automata. Theoretical Computer Science 78, 347–355 (1991)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  4. Sakarovitch, J.: Rational and recognisable power series. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, ch. 4. Springer (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Werner Kuich .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Ésik, Z., Kuich, W. (2014). On Power Series over a Graded Monoid. In: Calude, C., Freivalds, R., Kazuo, I. (eds) Computing with New Resources. Lecture Notes in Computer Science(), vol 8808. Springer, Cham. https://doi.org/10.1007/978-3-319-13350-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13350-8_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13349-2

  • Online ISBN: 978-3-319-13350-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics