Regular Sets
From MaRDI portal
Software:40507
swMATH28793MaRDI QIDQ40507FDOQ40507
Author name not available (Why is that?)
Cited In (16)
- Deciding Regular Expressions (In-)Equivalence in Coq
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- A formalisation of the Myhill-Nerode theorem based on regular expressions
- Title not available (Why is that?)
- POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
- Programming and automating mathematics in the Tarski-Kleene hierarchy
- On Completeness of Omega-Regular Algebras
- Building program construction and verification tools from algebraic principles
- Completeness for Identity-free Kleene Lattices
- Regular language representations in the constructive type theory of Coq
- Proof Pearl: regular expression equivalence and relation algebra
- Proving language inclusion and equivalence by coinduction
- Verified decision procedures for MSO on words based on derivatives of regular expressions
- Deciding Kleene algebra terms equivalence in Coq
- Deciding Kleene algebras in \texttt{Coq}
- Automated Reasoning in Higher-Order Regular Algebra
This page was built for software: Regular Sets
