Skip to main content
SpringerLink
Log in

Left-Handed Completeness

  • Conference paper
Relational and Algebraic Methods in Computer Science (RAMICS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7560))

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.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boffa, M.: Une condition impliquant toutes les identités rationnelles. Informatique Théorique et Applications/Theoretical Informatics and Applications 29(6), 515–518 (1995)

    MathSciNet  Google Scholar 

  2. 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)

    Google Scholar 

  3. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)

    MATH  Google Scholar 

  4. Ésik, Z.: Group axioms for iteration. Inf. Comput. 148(2), 131–180 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. 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)

    Google Scholar 

  7. Kot, Ł., Kozen, D.: Second-order abstract interpretation via Kleene algebra. Technical Report TR2004-1971, Computer Science Department, Cornell University (December 2004)

    Google Scholar 

  8. 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)

    Google Scholar 

  9. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Infor. and Comput. 110(2), 366–390 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kozen, D., Silva, A.: Left-handed completeness. Technical Report, Computing and Information Science, Cornell University (August 2011), http://hdl.handle.net/1813/23556

  11. Kozen, D., Tiuryn, J.: Substructural logic and partial correctness. Trans. Computational Logic 4(3), 355–378 (2003)

    Article  MathSciNet  Google Scholar 

  12. Krob, D.: A complete system of B-rational identities. Theoretical Computer Science 89(2), 207–343 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  13. 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)

    Chapter  Google Scholar 

  14. Rutten, J.J.M.M.: A coinductive calculus of streams. Mathematical Structures in Computer Science 15(1), 93–147 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  15. Salomaa, A.: Two complete axiom systems for the algebra of regular events. J. Assoc. Comput. Mach. 13(1), 158–169 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  16. Silva, A.: Kleene Coalgebra. PhD thesis, University of Nijmegen (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Cornell University, Ithaca, NY, 14853-7501, USA

    Dexter Kozen

  2. Radboud University, Postbus 9010, 6500 GL, Nijmegen, The Netherlands

    Alexandra Silva

Authors
  1. Dexter Kozen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexandra Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing and Software, McMaster University, 1280 Main Street West, L8S 4K1, Hamilton, ON, Canada

    Wolfram Kahl

  2. Computer Laboratory, University of Cambridge, 15 JJ Thomson Avenue, CB3 0FD, Cambridge, UK

    Timothy G. Griffin

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation