Skip to main content
SpringerLink
Log in

On the Fine-Structure of Regular Algebra

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Regular algebra is the algebra of regular expressions as induced by regular language identity. We use Isabelle/HOL for a detailed systematic study of the regular algebra axioms given by Boffa, Conway, Kozen and Salomaa. We investigate the relationships between these systems, formalise a soundness proof for the smallest class (Salomaa’s) and obtain completeness for the largest one (Boffa’s) relative to a deep result by Krob. As a case study in formalised mathematics, our investigations also shed some light on the power of theorem proving technology for reasoning with algebras and their models, including proof automation and counterexample generation.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Armstrong, A., Struth, G., Weber, T.: Kleene algebra. Archive of Formal Proofs 2013 (2013)

  2. Benzmüller, C., Sultana, N.: Leo-II Version 1.5. In: Blanchette, J.C., Urban, J. (eds.) PxTP 2013, EPiC Series, vol. 14, pp. 2–10. EasyChair (2013)

  3. Blanchette, J.C., Bulwahn, L., Nipkow, T.: Automatic proof and disproof in Isabelle/HOL. In: Tinelli, C., Sofronie-Stokkermans, V. (eds.) FroCos 2011, LNAI, vol. 6989, pp. 12–27. Springer (2011)

  4. Blanchette, J.C., Nipkow, T.: Nitpick: A counterexample generator for higher-order logic based on a relational model finder. In: Kaufmann, M., Paulson, L.C. (eds.) Interactive Theorem Proving, LNCS, vol. 6172, pp. 131–146. Springer (2010)

  5. Bloom, S.L., Ésik, Z.: Equational axioms for regular sets. Math. Struct. Comput. Sci. 3(1), 1–24 (1993)

    Article  MATH  Google Scholar 

  6. Boffa, M.: Une remarque sur les systèmes complets d’identités rationnelles. Inf. théorique et Appl. 24(4), 419–423 (1990)

    MathSciNet  MATH  Google Scholar 

  7. Boffa, M.: Une condition impliquant toutes les identités rationnelles. Inf. théorique et Appl. 29(6), 515–518 (1995)

    MathSciNet  MATH  Google Scholar 

  8. Braibant, T., Pous, D.: An efficient Coq tactic for deciding Kleene algebras. In: Kaufmann, M., Paulson, L. (eds.) ITP 2010, LNCS, vol. 6172, pp. 163–178. Springer (2010)

  9. Bulwahn, L.: The new Quickcheck for Isabelle. In: Hawblitzel, C., Miller, D. (eds.) Certified Programs and Proofs, LNCS, vol. 7679, pp. 92–108. Springer (2012)

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

  11. Eilenberg, S.: Automata, Languages and Machines. Academic Press (1976)

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

    Article  MATH  Google Scholar 

  13. Foster, S., Struth, G.: Regular algebras. Archive of Formal Proofs 2014 (2014)

  14. Ginzburg, A.: Algebraic Theory of Automata. Academic Press (1968)

  15. Gordon, M.J.C., Reynolds, J., Hunt, W.A., Kaufmann, M.: An integration of HOL and ACL2, FMCAD 2006, pp 153–160. IEEE Computer Society (2006)

  16. Höfner, P., Struth, G.: Algebraic notions of nontermination: Omega and divergence in idempotent semirings. J. Logic Algebraic Program. 79(8), 794–811 (2010)

    Article  MATH  Google Scholar 

  17. Huffman, B., Kuncar, O.: Lifting and transfer: A modular design for quotients in Isabelle/HOL. In: Gonthier, G., Norrish, M. (eds.) CPP 2013, LNCS, vol. 8307, pp. 131–146. Springer International Publishing (2013)

  18. Iancu, M., Rabe, F.: Formalizing foundations of mathematics. Math. Struct. Comput. Sci. 21, 883–911 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, chapter 1956, pp 3–41. Princeton University Press (1956)

  20. Kozen, D.: On Kleene algebras and closed semirings. In: Rovan, B. (ed.) MFCS’90, LNCS, vol. 452, pp 26–47. Springer (1990)

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

    Article  MathSciNet  MATH  Google Scholar 

  22. Kozen, D., Silva, A.: Left-handed completeness. In: Kahl, W., Griffin, T.G. (eds.) RAMiCS 2012, LNCS, vol. 7560, pp 162–178. Springer (2012)

  23. Krob, D.: Complete systems of \(\mathcal {B}\)-rational identities. Theor. Comput. Sci. 89, 207–343 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  24. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL: A Proof Assistant for Higher-Order Logic, LNCS, vol. 2283. Springer (2002)

  25. Nipkow, T., Traytel, D.: Unified decision procedures for regular expression equivalence. In: Klein, G., Gamboa, R. (eds.) ITP 2014, LNCS, vol. 8558, pp 450–466. Springer (2014)

  26. Pratt, V.: Action logic and pure induction. Technical Report STAN-CS-90-1343, Department of Computer Science. Stanford University (1990)

  27. Redko, V.N.: On the determining totality of an algebra of regular events. Ukrain. Math. Z 16, 120–126 (1964). (in Russian)

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  29. Wu, C., Zhang, X., Urban, C.: A formalisation of the myhill-nerode theorem based on regular expressions. J. Autom. Reason. 52(4), 451–480 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of York, York, UK

    Simon Foster

  2. Department of Computer Science, University of Sheffield, Sheffield, UK

    Georg Struth

Authors
  1. Simon Foster
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georg Struth
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Georg Struth.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Foster, S., Struth, G. On the Fine-Structure of Regular Algebra. J Autom Reasoning 54, 165–197 (2015). https://doi.org/10.1007/s10817-014-9318-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-014-9318-9

Keywords

Search

Navigation