Skip to main content

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

  • 918 Accesses

Abstract

We study k-regular sequences from a coalgebraic perspective. Building on the observation that the set of streams over a semiring S can be turned into a final coalgebra, we obtain characterizations of k-regular sequences in terms of finite weighted automata, finite systems of behavioral differential equations, and recognizable power series. The latter characterization is obtained via an isomorphism of final coalgebras based on the k-adic numeration system.

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

Access this chapter

eBook
USD 16.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. Allouche, J.-P., Shallit, J.O.: The ring of k-regular sequences. Theoretical Computer Science 98, 163–197 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Allouche, J.-P., Shallit, J.O.: Automatic Sequences – Theory, Applications, Generalizations. Cambridge University Press (2003)

    Google Scholar 

  3. Allouche, J.-P., Shallit, J.O.: The ring of k-regular sequences, II. Theoretical Computer Science 307, 3–29 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bartels, F.: On Generalized Coinduction and Probabilistic Specification Formats. PhD thesis, Vrije Universiteit Amsterdam (2004)

    Google Scholar 

  5. Bell, J.P.: On the values attained by a k-regular sequence. Advances in Applied Mathematics 34, 634–643 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Berstel, J., Reutenauer, C.: Noncommutative Rational Series with Applications. Cambridge University Press (2011)

    Google Scholar 

  7. Bonsangue, M.M., Rutten, J., Winter, J.: Defining context-free power series coalgebraically. In: Pattinson, D., Schröder, L. (eds.) CMCS 2012. LNCS, vol. 7399, pp. 20–39. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  8. Ésik, Z., Maletti, A.: The category of simulations for weighted tree automata. International Journal of Foundations of Computer Science (IJFCS) 22(8), 1845–1859 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Grabmayer, C., Endrullis, J., Hendriks, D., Klop, J.W., Moss, L.S.: Automatic sequences and zip-specifications. In: Proceedings of Logic in Computer Science (LICS 2012), pp. 335–344. IEEE Computer Society Press (2012)

    Google Scholar 

  10. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science, 2nd edn. Addison-Wesley Longman Publishing Co., Inc. (1994)

    Google Scholar 

  11. Hinze, R.: Concrete stream calculus—an extended study. Journal of Functional Programming 20(5-6), 463–535 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kupke, C., Rutten, J.J.M.M.: On the final coalgebra of automatic sequences. In: Constable, R.L., Silva, A. (eds.) Kozen Festschrift. LNCS, vol. 7230, pp. 149–164. Springer, Heidelberg (2012)

    Google Scholar 

  13. Douglas McIlroy, M.: The music of streams. Information Processing Letters 77(2-4), 189–195 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  14. Mendler, N.P., Panangaden, P., Constable, R.L.: Infinite objects in type theory. In: Proceedings of Logic in Computer Science (LICS 1986), pp. 249–255. IEEE Computer Society Press (1986)

    Google Scholar 

  15. Moshe, Y.: On some questions regarding k-regular and k-context-free sequences. Theoretical Computer Science 400, 62–69 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Rajopadhye, S.V., Panangaden, P.: Verification of systolic arrays: A stream function approach. In: International Conference on Parallel Processing (ICPP 1986), pp. 773–775. IEEE Computer Society Press (1986)

    Google Scholar 

  17. Rutten, J.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3–80 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Rutten, J.: Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoretical Computer Science 308(1-3), 1–53 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  19. Silva, A., Bonchi, F., Bonsangue, M., Rutten, J.: Generalizing determinization from automata to coalgebras. Logical Methods in Computer Science 9(1) (2013)

    Google Scholar 

  20. Stephan, R.: Divide-and-conquer generating functions. Part I. Elementary sequences. ArXiv Mathematics e-prints (July 2003)

    Google Scholar 

  21. Winter, J.: QStream: a suite of streams. In: Heckel, R., Milius, S. (eds.) CALCO 2013. LNCS, vol. 8089, pp. 353–358. Springer, Heidelberg (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Hansen, H.H., Kupke, C., Rutten, J., Winter, J. (2014). A Final Coalgebra for k-regular Sequences. In: van Breugel, F., Kashefi, E., Palamidessi, C., Rutten, J. (eds) Horizons of the Mind. A Tribute to Prakash Panangaden. Lecture Notes in Computer Science, vol 8464. Springer, Cham. https://doi.org/10.1007/978-3-319-06880-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-06880-0_19

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-06879-4

  • Online ISBN: 978-3-319-06880-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics