Abstract
For polynomial functors G, we show how to generalize the classical notion of regular expression to G-coalgebras. We introduce a language of expressions for describing elements of the final G-coalgebra and, analogously to Kleeneās theorem, we show the correspondence between expressions and finite G-coalgebras.
Chapter PDF
Similar content being viewed by others
References
Aczel, P., Mendler, N.: A Final Coalgebra Theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., PoignĆ©, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol.Ā 389, pp. 357ā365. Springer, Heidelberg (1989)
Bonsangue, M., Rutten, J., Silva, A.: Regular expressions for polynomial coalgebras. CWI Technical report E0703 (2007)
Bonsangue, M., Rutten, J., Silva, A.: Coalgebraic logic and synthesis of mealy machines. In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol.Ā 4962, pp. 231ā245. Springer, Heidelberg (2008)
Brzozowski, J.A.: Derivatives of regular expressions. Journal of the ACMĀ 11(4), 481ā494 (1964)
Ćsik, Z.: Axiomatizing the equational theory of regular tree languages (extended abstract). In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.Ā 1373, pp. 455ā465. Springer, Heidelberg (1998)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., Boston (2006)
Jacobs, B.: Many-sorted coalgebraic modal logic: a model-theoretic study. ITAĀ 35(1), 31ā59 (2001)
Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies, 3ā42 (1956)
Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. In: Logic in Computer Science, pp. 214ā225 (1991)
Kozen, D.: Automata and Computability. Springer, New York (1997)
Kozen, D.: On the coalgebraic theory of Kleene algebra with tests. Technical Report, Computing and Information Science, Cornell University (March 2008), http://hdl.handle.net/1813/10173
Kurz, A.: Coalgebras and Their Logics. SIGACT NewsĀ 37(2), 57ā77 (2006)
RƶĆiger, M.: Coalgebras and modal logic. ENTCS, 33 (2000)
Rutten, J.: Universal coalgebra: a theory of systems. TCSĀ 249(1), 3ā80 (2000)
Rutten, J.: Automata and coinduction (an exercise in coalgebra). In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.Ā 1466, pp. 194ā218. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonsangue, M., Rutten, J., Silva, A. (2009). A Kleene Theorem for Polynomial Coalgebras. In: de Alfaro, L. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2009. Lecture Notes in Computer Science, vol 5504. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00596-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-00596-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00595-4
Online ISBN: 978-3-642-00596-1
eBook Packages: Computer ScienceComputer Science (R0)