Skip to main content
SpringerLink
Log in

Automata and coinduction (an exercise in coalgebra)

  • Conference paper
  • First Online:
CONCUR'98 Concurrency Theory (CONCUR 1998)

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

Included in the following conference series:

Abstract

The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to a transparent and uniform presentation of automata theory and yields some new insights, amongst which coinduction proof methods for language equality and language inclusion. At the same time, the present treatment of automata theory may serve as an introduction to coalgebra.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Aczel. Non-well-founded sets. Number 14 in CSLI Lecture Notes. Center for the Study of Languages and Information, Stanford, 1988.

    Google Scholar 

  2. P. Aczel and N. Mendler. A final coalgebra theorem. In D.H. Pitt, D.E. Ryeheard, P. Dybjer, A. M. Pitts, and A. Poigne, editors, Proceedings category theory and computer science, Lecture Notes in Computer Science, pages 357–365, 1989.

    Google Scholar 

  3. J. Barwise and L.S. Moss. Vicious Circles, On the Mathematics of Non wellfounded Phenomena. CSLI Lecture Notes. Center for the Study of Language and Information, Stanford, 1996.

    Google Scholar 

  4. J.A. Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11(4):481–494, 1964.

    Article  MATH  MathSciNet  Google Scholar 

  5. G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoretical Computer Science, 48:117–126, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  6. J.W. de Bakker and E. de Vink. Control Flow Semantics. Foundations of Computing Series. The MIT Press, 1996.

    Google Scholar 

  7. J.H. Conway. Regular algebra and finite machines. Chapman and Hall, 1971.

    Google Scholar 

  8. J.W. de Bakker. Comparative semantics for flow of control in logic programming without logic. Information and Computation, 94(2):123–179, October 1991.

    Article  MATH  MathSciNet  Google Scholar 

  9. F. Gécseg. Products of automata, volume 7 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1986.

    Google Scholar 

  10. A. Ginzburg. Algebraic theory of automata. ACM Monograph series. Academic Press, 1968.

    Google Scholar 

  11. J. Goguen. Realization is universal. Mathematical System Theory, 6:359–374, 1973.

    Article  MATH  MathSciNet  Google Scholar 

  12. B. Jacobs, L. Moss, H. Reichel, and J.J.M.M. Rutten, editors. Proceedings of the first international workshop on Coalgebraic Methods in Computer Science (CMCS '98), volume 11 of Electronic Notes in Theoretical Computer Science. Elsevier Science B.V., 1998. Available at URL: www.elsevier.nl/locate/entcs.

    Google Scholar 

  13. Bart Jacobs and Jan Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of EATCS, 62:222–259, 1997.

    MATH  Google Scholar 

  14. S.C. Kleene. Representation of events in nerve nets and finite automata. In Shannon and McCarthy, editors, Automata Studies, pages 3–41. Princeton Univ. Press, 1956.

    Google Scholar 

  15. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110:366–390, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  16. D.C. Kozen. Automata and computability. Undergraduate Texts in Computer Science. Springer-Verlag, 1997.

    Google Scholar 

  17. R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1980.

    Google Scholar 

  18. A. Nerode. Linear automaton transformations. Proc. Amer. Math. Soc., 9:541–544, 1958.

    Article  MATH  MathSciNet  Google Scholar 

  19. D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Proceedings 5th GI conference, volume 104 of Lecture Notes in Computer Science, pages 15–32. Springer-Verlag, 1981.

    Google Scholar 

  20. M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM J. Res. Develop., 3(2):114–125, 1959.

    Article  MathSciNet  Google Scholar 

  21. J.J.M.M. Rutten and D. Turi. On the foundations of final semantics: non-standard sets, metric spaces, partial orders. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Proceedings of the REX Workshop on Semantics, volume 666 of Lecture Notes in Computer Science, pages 477–530. Springer-Verlag, 1993.

    Google Scholar 

  22. J.J.M.M. Rutten. Universal coalgebra: a theory of systems. Report CS-R9652, CWI, 1996. Available at www.cwi.nl/~janr. To appear in Theoretical Computer Science.

    Google Scholar 

  23. A. Salomaa. Two complete axiom systems for the algebra of regular events. Journal of the ACM, 13(1):158–169, 1966.

    Article  MATH  MathSciNet  Google Scholar 

  24. F. van Breugel. Terminal metric spaces of finitely branching and image finite linear processes. Theoretical Computer Science, 202:193–222, 1998.

    Article  MathSciNet  Google Scholar 

  25. B.W. Watson. Taxonomies and toolkits of regular language algorithms. PhD thesis, Eindhoven University of Technology, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, P.O. Box 94079, 1090, GB Amsterdam, The Netherlands

    J. J. M. M. Rutten

Authors
  1. J. J. M. M. Rutten
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Davide Sangiorgi Robert de Simone

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rutten, J.J.M.M. (1998). Automata and coinduction (an exercise in coalgebra). In: Sangiorgi, D., de Simone, R. (eds) CONCUR'98 Concurrency Theory. CONCUR 1998. Lecture Notes in Computer Science, vol 1466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055624

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64896-3

  • Online ISBN: 978-3-540-68455-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation