1. Kamal Aboul-Hosn & Dexter Kozen (2006): KAT-ML: An Interactive Theorem Prover for Kleene Algebra with Tests. Journal of Applied Non-Classical Logics 16(1–2), pp. 9–33, doi:10.3166/jancl.16.9-33.
  2. Marco Almeida (2011): Equivalence of regular languages: an algorithmic approach and complexity analysis. Faculdade de Ciências das Universidade do Porto.
  3. Marco Almeida, Nelma Moreira & Rogério Reis (2009): Antimirov and Mosses's rewrite system revisited. International Journal of Foundations of Computer Science 20(04), pp. 669 – 684, doi:10.1142/S0129054109006802.
  4. Valentin M. Antimirov (1996): Partial Derivatives of Regular Expressions and Finite Automaton Constructions.. Theoret. Comput. Sci. 155(2), pp. 291–319, doi:10.1016/0304-3975(95)00182-4.
  5. Valentin M. Antimirov & Peter D. Mosses (1994): Rewriting Extended Regular Expressions. In: G. Rozenberg & A. Salomaa: Developments in Language Theory. World Scientific, pp. 195 – 209.
  6. S. Ajesh Babu & Paritosh K Pandya (2011): Chop Expressions and Discrete Duration Calculus. In: Modern Applications of Automata Theory 2. World Scientific, pp. 1–30.
  7. H. Chen & R. Pucella (2004): A coalgebraic approach to Kleene algebra with tests. Theor. Comp. Sci. 327(1-2), pp. 23–44, doi:10.1016/j.tcs.2004.07.020.
  8. Ernie Cohen, Dexter Kozen & Frederick Smith (1996): The complexity of Kleene algebra with tests. Technical Report TR96-1598. Computer Science Department, Cornell University.
  9. Project FAdo (Access date:1.1.2012): FAdo: tools for formal languages manipulation.
  10. Maria João Frade & Jorge Sousa Pinto (2011): Verification conditions for source-level imperative programs. Computer Science Review 5(3), pp. 252–277, doi:10.1016/j.cosrev.2011.02.002.
  11. C. A. R. Hoare (1969): An axiomatic basis for computer programming. Comm. of the ACM 12(10), pp. 576–580, doi:10.1145/357980.358001.
  12. Peter Hófner & Georg Struth (2007): Automated Reasoning in Kleene Algebra. In: F. Pfenning: CADE 2007, LNAI 4603. Springer-Verlag, pp. 279–294, doi:10.1007/978-3-540-73595-3-19.
  13. Dexter Kozen (1994): A completeness theorem for Kleene algebras and the algebra of regular events. Infor. and Comput. 110(2), pp. 366–390, doi:10.1006/inco.1994.1037.
  14. Dexter Kozen (1997): Kleene algebra with tests. Trans. on Prog. Lang. and Systems 19(3), pp. 427–443, doi:10.1145/256167.256195.
  15. Dexter Kozen (2000): On Hoare logic and Kleene algebra with tests. Trans. Comput. Logic 1(1), pp. 60–76, doi:10.1145/343369.343378.
  16. Dexter Kozen (2003): Automata on Guarded Strings and Applications. Matématica Contemporânea 24, pp. 117–139.
  17. Dexter Kozen (2008): On the coalgebraic theory of Kleene algebra with tests. Computing and Information Science Technical Reports Cornell University.
  18. Dexter Kozen & Frederick Smith (1996): Kleene algebra with tests: Completeness and decidability. In: D. van Dalen & M. Bezem: Proc. 10th CSL, LNCS 1258. Springer-Verlag, pp. 244–259, doi:10.1007/3-540-63172-0-43.
  19. Boris Mirkin (1966): An Algorithm for Constructing a Base in a Language of Regular Expressions. Engineering Cybernetics 5, pp. 110–116.
  20. Jan J. M. M. Rutten (1998): Automata and Coinduction (An Exercise in Coalgebra). In: Davide Sangiorgi & Robert de Simone: CONCUR'98 Concurrency Theory, LNCS 1466. Springer, pp. 194–218, doi:10.1007/BFb0055624.
  21. The Caml team (Access date: 1.5.2012): Ocaml.

Comments and questions to:
For website issues: