Kleene Algebra
By: Tobias Kappé, Alexandra Silva, Jana Wagemaker
Potential Business Impact:
Proves computer programs are equal using math rules.
This booklet serves as an introduction to Kleene Algebra (KA), a set of laws that can be used to study general equivalences between programs. It discusses how general programs can be modeled using regular expressions, how those expressions correspond to automata, and how this correspondence can be exploited to obtain the central result of KA, namely that an equivalence of regular expressions is true if and only if it can be proved using the laws of KA. Each chapter closes with a set of exercises to further build intuition and understanding, and there is an optional chapter that develops automata theory through the lens of coalgebra.
Similar Papers
Bringing Algebraic Hierarchical Decompositions to Concatenative Functional Languages
Formal Languages and Automata Theory
Builds smarter computer programs from math ideas.
Kleene Algebrae, Kleene Modules, and Morita Equivalence
Logic in Computer Science
Unlocks new ways to understand computer programs.
Paraconsistent Relations as a Variant of Kleene Algebras
Logic in Computer Science
Lets computers handle messy, unclear results.