An elementary proof of the FMP for Kleene algebra
From MaRDI portal
Cites work
- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
- A completeness theorem for Kleene algebras and the algebra of regular events
- A fast compiler for NetKAT
- A Kleene theorem for higher-dimensional automata
- Checking NFA equivalence with bisimulations up to congruence
- Completeness and the finite model property for Kleene algebra, reconsidered
- Completeness theorems for bi-Kleene algebras and series-parallel rational pomset languages
- Concurrent Kleene Algebra
- Concurrent Kleene algebra with tests and branching automata
- Concurrent Kleene algebra: free model and completeness
- Deciding Kleene algebras in \texttt{Coq}
- Derivatives of Regular Expressions
- scientific article; zbMATH DE number 1688351 (Why is no real title available?)
- scientific article; zbMATH DE number 1696821 (Why is no real title available?)
- scientific article; zbMATH DE number 4210141 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 177804 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 3251424 (Why is no real title available?)
- scientific article; zbMATH DE number 3287733 (Why is no real title available?)
- scientific article; zbMATH DE number 3316966 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Left-handed completeness
- Left-Handed Completeness for Kleene algebra, via Cyclic Proofs
- Netkat, semantic foundations for networks
- On finite model property of the equational theory of Kleene algebras
- On series-parallel pomset languages: rationality, context-freeness and automata
- On the fine-structure of regular algebra
- On the Representation of Kleene Algebras with Tests
- Partial derivatives of regular expressions and finite automaton constructions
- Programming Techniques: Regular expression search algorithm
- Substructural logic and partial correctness
- Symbolic algorithms for language equivalence and Kleene algebra with tests
- The Böhm–Jacopini Theorem Is False, Propositionally
- Two Complete Axiom Systems for the Algebra of Regular Events
- Une remarque sur les systèmes complets d'identités rationnelles
- Universal coalgebra: A theory of systems
This page was built for publication: An elementary proof of the FMP for Kleene algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6844593)
