Abstract
We give a new, significantly shorter proof of the completeness of the left-handed star rule of Kleene algebra. The proof exposes the rich interaction of algebra and coalgebra in the theory of Kleene algebra.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boffa, M.: Une condition impliquant toutes les identités rationnelles. Informatique Théorique et Applications/Theoretical Informatics and Applications 29(6), 515–518 (1995)
Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Mathematical Theory of Automata. MRI Symposia Series, vol. 12, pp. 529–561. Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y (1962)
Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)
Ésik, Z.: Group axioms for iteration. Inf. Comput. 148(2), 131–180 (1999)
Jacobs, B.: A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Goguen Festschrift. LNCS, vol. 4060, pp. 375–404. Springer, Heidelberg (2006)
Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3–41. Princeton University Press, Princeton (1956)
Kot, Ł., Kozen, D.: Second-order abstract interpretation via Kleene algebra. Technical Report TR2004-1971, Computer Science Department, Cornell University (December 2004)
Kot, Ł., Kozen, D.: Kleene algebra and bytecode verification. In: Spoto, F. (ed.) Proc. 1st Workshop Bytecode Semantics, Verification, Analysis, and Transformation (Bytecode 2005), pp. 201–215 (April 2005)
Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Infor. and Comput. 110(2), 366–390 (1994)
Kozen, D., Silva, A.: Left-handed completeness. Technical Report, Computing and Information Science, Cornell University (August 2011), http://hdl.handle.net/1813/23556
Kozen, D., Tiuryn, J.: Substructural logic and partial correctness. Trans. Computational Logic 4(3), 355–378 (2003)
Krob, D.: A complete system of B-rational identities. Theoretical Computer Science 89(2), 207–343 (1991)
Rutten, J.J.M.M.: 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)
Rutten, J.J.M.M.: A coinductive calculus of streams. Mathematical Structures in Computer Science 15(1), 93–147 (2005)
Salomaa, A.: Two complete axiom systems for the algebra of regular events. J. Assoc. Comput. Mach. 13(1), 158–169 (1966)
Silva, A.: Kleene Coalgebra. PhD thesis, University of Nijmegen (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kozen, D., Silva, A. (2012). Left-Handed Completeness. In: Kahl, W., Griffin, T.G. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2012. Lecture Notes in Computer Science, vol 7560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33314-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-33314-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33313-2
Online ISBN: 978-3-642-33314-9
eBook Packages: Computer ScienceComputer Science (R0)