Automata and coinduction (an exercise in coalgebra)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1466, Issue , 1998, Pages 194-218

  Rutten, J J M M ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BISIMULATIONS; CLASSICAL THEORY; COALGEBRAS; COINDUCTION; DETERMINISTIC AUTOMATA; PROOF METHODS;

AUTOMATA THEORY;

EID: 84945953914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055624     Document Type: Conference Paper

References (25)

1. P. Aczel. Non-well-founded sets. Number 14 in CSLI Lecture Notes. Center for the Study of Languages and Information, Stanford, 1988.
2. P. Aczel and N. Mendier. 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.
3. J. Barwise and L.S. Moss. Vicious Circles, On the Mathematics of Non-uiellfounded Phenomena. CSLI Lecture Notes. Center for the Study of Language and Information, Stanford, 1996.
4. J.A. Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11(4): 481-494, 1964.
5. G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoretical Computer Science, 48: 117-126, 1986.
6. J.W. de Bakker and E. de Vink. Control Flow Semantics. Foundations of Computing Series. The MIT Press, 1996.
7. J.H. Conway. Regular algebra and finite machines. Chapman and Hall, 1971.
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.
9. F. Gécseg. Products of automata, volume 7 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1986.
10. A. Ginzburg. Algebraic theory of automata. ACM Monograph series. Academic Press, 1968.
11. J. Goguen. Realization is universal. Mathematical System Theory, 6: 359-374, 1973.
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.
13. Bart Jacobs and Jan Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of EATCS, 62: 222-259, 1997.
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.
15. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110: 366-390, 1994.
16. D.C. Kozen. Automata and computability. Undergraduate Texts in Computer Science. Springer-Verlag, 1997.
17. R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1980.
18. A. Nerode. Linear automaton transformations. Proc. Amer. Math. Soc, 9: 541-544, 1958.
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.
20. M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM J. Res. Develop., 3(2): 114-125, 1959.
21. J.J.M.M. Rutten and D. Turi. On the foundations of final semantics: nonstandard 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.
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.
23. A. Salomaa. Two complete axiom systems for the algebra of regular events. Journal of the ACM, 13(1): 158-169, 1966.
24. F. van Breugel. Terminal metric spaces of finitely branching and image finite linear processes. Theoretical Computer Science, 202: 193-222, 1998.
25. B.W. Watson. Taxonomies and toolkits of regular language algorithms. PhD thesis, Eindhoven University of Technology, 1995.