Completeness and the Finite Model Property for Kleene Algebra, Reconsidered

12/21/2022
by   Tobias Kappé, et al.
0

Kleene Algebra (KA) is the algebra of regular expressions. Central to the study of KA is Kozen's (1994) completeness result, which says that any equivalence valid in the language model of KA follows from the axioms of KA. Also of interest is the finite model property (FMP), which says that false equivalences always have a finite counterexample. Palka (2005) showed that, for KA, the FMP is equivalent to completeness. We provide a unified and elementary proof of both properties. In contrast with earlier completeness proofs, this proof does not rely on minimality or bisimilarity techniques for deterministic automata. Instead, our approach avoids deterministic automata altogether, and uses Antimirov's derivatives and the well-known transition monoid construction. Our results are fully verified in the Coq proof assistant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/15/2021

On Star Expressions and Coalgebraic Completeness Theorems

An open problem posed by Milner asks for a proof that a certain axiomati...
research
08/22/2022

Regular languages defined by first-order formulas without quantifier alternation

We give a simple new proof that regular languages defined by first-order...
research
08/31/2022

Geometrical tilings : distance, topology, compactness and completeness

We present the different distances on tilings of Rd that exist in the li...
research
05/02/2020

On infinite guarded recursive specifications in process algebra

In most presentations of ACP with guarded recursion, recursive specifica...
research
01/17/2022

Skip Letters for Short Supersequence of All Permutations

A supersequence over a finite set is a sequence that contains as subsequ...
research
10/24/2022

On Tools for Completeness of Kleene Algebra with Hypotheses

In the literature on Kleene algebra, a number of variants have been prop...
research
12/10/2021

Algebraic Properties of Subquasigroups and Construction of Cryptographically Suitable Finite Quasigroups

In this paper, we identify many important properties and develop criteri...

Please sign up or login with your details

Forgot password? Click here to reset