The following pages link to Deciding Kleene Algebras in Coq (Q2881083):
Displaying 12 items.
- Algorithms for Kleene algebra with converse (Q299194) (← links)
- Proving language inclusion and equivalence by coinduction (Q899321) (← links)
- Regular language representations in the constructive type theory of Coq (Q1663246) (← links)
- Refinement to certify abstract interpretations: illustrated on linearization for polyhedra (Q1739912) (← links)
- Using relation-algebraic means and tool support for investigating and computing bipartitions (Q2360655) (← links)
- Two-Way Automata in Coq (Q2829256) (← links)
- Towards Certifiable Implementation of Graph Transformation via Relation Categories (Q2915137) (← links)
- Deciding Synchronous Kleene Algebra with Derivatives (Q2947408) (← links)
- Nominal Kleene Coalgebra (Q3449483) (← links)
- A Formalisation of Finite Automata Using Hereditarily Finite Sets (Q3454094) (← links)
- Completeness for Identity-free Kleene Lattices (Q5009432) (← links)
- (Q5875344) (← links)
