References

  1. Hajnal Andréka, Szabolcs Mikulás & István Németi (2011): The equational theory of Kleene lattices. Theoretical Computer Science 412(52), pp. 7099–7108, doi:10.1016/J.TCS.2011.09.024.
  2. S. L. Bloom, Z. Ésik & Gh. Stefanescu (1995): Notes on equational theories of relations. algebra universalis 33(1), pp. 98–126, doi:10.1007/BF01190768.
  3. John H. Conway (1971): Regular Algebra and Finite Machines. Chapman and Hall.
  4. Stephen A. Cook (1971): The complexity of theorem-proving procedures. In: STOC. ACM, pp. 151–158, doi:10.1145/800157.805047.
  5. Harry B. Hunt III, Daniel J. Rosenkrantz & Thomas G. Szymanski (1976): On the equivalence, containment, and covering problems for the regular and context-free languages. Journal of Computer and System Sciences 12(2), pp. 222–268, doi:10.1016/S0022-0000(76)80038-4.
  6. S. C. Kleene (1951): Representation of Events in Nerve Nets and Finite Automata. Technical Report. RAND Corporation. Available at https://www.rand.org/pubs/research_memoranda/RM704.html.
  7. Dexter Kozen & Frederick Smith (1996): Kleene algebra with tests: Completeness and decidability. In: CSL, LNCS 1258. Springer, pp. 244–259, doi:10.1007/3-540-63172-0_43.
  8. A. R. Meyer & L. J. Stockmeyer (1972): The equivalence problem for regular expressions with squaring requires exponential space. In: SWAT. IEEE, pp. 125–129, doi:10.1109/SWAT.1972.29.
  9. Yoshiki Nakamura (2023): Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations. In: LICS. IEEE, pp. 1–13, doi:10.1109/LICS56636.2023.10175811.
  10. Kan Ching Ng (1984): Relation algebras with transitive closure. University of California.
  11. Damien Pous & Jana Wagemaker (2022): Completeness Theorems for Kleene Algebra with Top. In: CONCUR 243. Schloss Dagstuhl, pp. 26:1–26:18, doi:10.4230/LIPICS.CONCUR.2022.26.
  12. Larry J. Stockmeyer & Albert R. Meyer (1973): Word problems requiring exponential time (Preliminary Report). In: STOC. ACM, pp. 1–9, doi:10.1145/800125.804029.
  13. Alfred Tarski (1941): On the Calculus of Relations. The Journal of Symbolic Logic 6(3), pp. 73–89, doi:10.2307/2268577.
  14. Ken Thompson (1968): Programming Techniques: Regular expression search algorithm. Communications of the ACM 11(6), pp. 419–422, doi:10.1145/363347.363387.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org