Pages that link to "Item:Q2914749"
From MaRDI portal
The following pages link to A Compact Proof of Decidability for Regular Expression Equivalence (Q2914749):
Displaying 11 items.
- An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
- Deciding Kleene algebra terms equivalence in Coq (Q2347910) (← links)
- A formalisation of the Myhill-Nerode theorem based on regular expressions (Q2351151) (← links)
- Proof Pearl: regular expression equivalence and relation algebra (Q2392416) (← links)
- Deciding Regular Expressions (In-)Equivalence in Coq (Q2915138) (← links)
- A Decision Procedure for Bisimilarity of Generalized Regular Expressions (Q2999323) (← links)
- A Decision Procedure for Regular Expression Equivalence in Type Theory (Q3100207) (← links)
- Extended Regular Expressions: Succinctness and Decidability (Q3113715) (← links)
- (Q4874651) (← links)
- (Q4963995) (← links)
- Verified decision procedures for MSO on words based on derivatives of regular expressions (Q5371957) (← links)