Regular Sets
From MaRDI portal
Software:40507
No author found.
Related Items (16)
Deciding Kleene Algebras in Coq ⋮ Automated Reasoning in Higher-Order Regular Algebra ⋮ Deciding Regular Expressions (In-)Equivalence in Coq ⋮ On Completeness of Omega-Regular Algebras ⋮ Proof Pearl: regular expression equivalence and relation algebra ⋮ Regular language representations in the constructive type theory of Coq ⋮ Programming and automating mathematics in the Tarski-Kleene hierarchy ⋮ Proving language inclusion and equivalence by coinduction ⋮ Verified decision procedures for MSO on words based on derivatives of regular expressions ⋮ Completeness for Identity-free Kleene Lattices ⋮ Unnamed Item ⋮ Building program construction and verification tools from algebraic principles ⋮ POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl) ⋮ A Decision Procedure for Regular Expression Equivalence in Type Theory ⋮ Deciding Kleene algebra terms equivalence in Coq ⋮ A formalisation of the Myhill-Nerode theorem based on regular expressions
This page was built for software: Regular Sets
