A bialgebraic review of deterministic automata, regular expressions and languages

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

Volumn 4060 LNCS, Issue , 2006, Pages 375-404

  Jacobs, Bart ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORMAL LANGUAGES;

BRZOZOWSKI AUTOMATON STRUCTURE; DISTRIBUTIVE LAWS; REFORMULATED PROOF; REGULAR EXPRESSIONS;

AUTOMATA THEORY;

EID: 38549174610     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780274_20     Document Type: Conference Paper

References (36)

1. M.A. Arbib and E.G. Manes. Foundations of system theory: Decomposable systems. Automatica, 10:285-302, 1974.
2. M.A. Arbib and E.G. Manes. Algebraic Approaches to Program Semantics. Texts and Monogr. in Comp. Sei,. Springer, Berlin, 1986.
3. J.W. de Bakker and E. Vink. Control Flow Semantics. MIT Press, Cambridge, MA, 1996.
4. M. Barr and Ch. Wells. Toposes, Triples and Theories. Springer, Berlin, 1985. Revised and corrected version available from URL: www.cwru.edu/artsci/math/wells/pub/ttt.html.
5. F. Bartels. On generalised coinduction and probabilistic specification formats. Distributive laws in coalgebraic modelling. PhD thesis, Free Univ. Amsterdam, 2004.
6. J. Beck. Distributive laws. In B. Eckman, editor, Seminar on Triples and Categorical Homolgy Theory, number 80 in Lect. Notes Math, pages 119-140. Springer, Berlin, 1969.
7. B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced. Journ. ACM, 42(1):232-268, 1988.
8. J.A. Brzozowski. Derivatives of regular expressions. Journ. ACM, 11(4):481-494, 1964.
9. J.H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, 1971.
10. W. Fokkink. On the completeness of the equations for the Kleene star in bisimulation. In M. Wirsing and M. Nivat, editors, Algebraic Methodology and Software Technology, number 1101 in Lect. Notes Comp. Sci., pages 180-194. Springer, Berlin, 1996.
11. J.A. Goguen. Minimal realization of machines in closed categories. Bull. Amer. Math. Soc, 78(5):777-783, 1972.
12. J.A. Goguen. Realization is universal. Math. Syst. Theor., 6(4):359-374, 1973.
13. J.A. Goguen. Discrete-time machines in closed monoidal categories. I. Journ. Comp. Syst. Sci, 10:1-43, 1975.
14. J.F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Inf. & Comp., 100(2):202-260, 1992.
15. C. Hermida and B. Jacobs. Structural induction and coinduction in a fibrational setting. Inf. & Comp., 145:107-152, 1998.
16. B. Jacobs. Objects and classes, co-algebraically. In B. Freitag, C.B. Jones, C. Lengauer, and H.-J. Schek, editors, Object-Orientation with Parallelism and Persistence, pages 83-103. Kluwer Acad. Publ, 1996.
17. B. Jacobs. Exercises in coalgebraic specification. In R. Croie R. Backhouse and J. Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, number 2297 in Lect. Notes Comp. Sci., pages 237-280. Springer, Berlin, 2002.
18. B. Jacobs. Distributive laws for the coinductive solution of recursive equations. Inf. & Comp. 204(4), 2006, pages 561-587. Earlier version in number 106 in Elect. Notes in Theor. Comp. Sci.
19. P.T. Johnstone. Adjoint lifting theorems for categories of algebras. Bull. London Math. Soc, 7:294-297, 1975.
20. M. Kick. Bialgebraic modelling of timed processes. In P. Widmayer et al., editor, International Colloquium on Automata, Languages and Programming, number 2380 in Lect. Notes Comp. Sci, pages 525-536. Springer, Berlin, 2002.
21. S.C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy, editors, Automata Studies, number 34 in Annals of Mathematics Studies, pages 3-41. Princeton University Press, 1956.
22. S. Koushik and G. Rosu. Generating optimal monitors for extended regular expressions. In Runtime Verification (RV'03), number 89(2) in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2003.
23. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Inf. & Comp., 110(2):366-390, 1994.
24. D. Kozen. Myhill-nerode relations on automatic systems and the completeness of Kleene algebra. In A. Ferreira and H. Reichel, editors, Symposium on Theoretical Aspects of Computer Science, number 2010 in Lect. Notes Comp. Sci, pages 27-38. Springer, Berlin, 2001.
25. S. Mac Lane. Categories for the Working Mathematician. Springer, Berlin, 1971.
26. M. Lenisa, J. Power, and H. Watanabe. Distributivity for endofunctors, pointed and copointed endofunctors, monads and comonads. In H. Reichel, editor, Coalgebraic Methods in Computer Science, number 33 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2000.
27. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theor. Comp. Sci., 54(2/3):267-276, 1987.
28. D. Perrin. Finite automata. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 1-55. Elsevier/MIT Press, 1990.
29. H. Reichel. An approach to object semantics based on terminal co-algebras. Math. Struct, in Comp. Sci., 5:129-152, 1995.
30. J. Rutten. Automata and coinduction (an exercise in coalgebra). In D. Sangiorigi and R. de Simone, editors, Concur'98: Concurrency Theory, number 1466 in Lect. Notes Comp. Sei, pages 194-218. Springer, Berlin, 1998.
31. J. Rutten. Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theor. Comp. Sci., 308:1-53, 2003.
32. J. Rutten and D. Turi. Initial algebra and final coalgebra semantics for concurrency. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors, A Decade of Concurrency, number 803 in Lect. Notes Comp. Sci, pages 530-582. Springer, Berlin, 1994.
33. J.J.M.M. Rutten. Automata, power series, and coinduction: Taking input derivatives seriously (extended abstract). In J. Wiedermann, P. van Emde Boas, and M. Nielsen, editors, International Colloquium on Automata, Languages and Programming, number 1644 in Lect. Notes Comp. Sci, pages 645-654. Springer, Berlin, 1999.
34. D. Turi. Functorial operational semantics and its denotational dual. PhD thesis, Free Univ. Amsterdam, 1996.
35. D. Turi and G. Plotkin. Towards a mathematical operational semantics. In Logic in Computer Science, pages 280-291. IEEE, Computer Science Press, 1997.
36. T. Uustalu, V. Vene, and A. Pardo. Recursion schemes from comonads. Nordic Journ. Comput., 8(3):366-390, 2001.