Pages that link to "Item:Q2361347"
From MaRDI portal
The following pages link to Deciding definability by deterministic regular expressions (Q2361347):
Displaying 7 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- Deciding determinism of regular languages (Q493651) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Checking determinism of regular expressions with counting (Q2343138) (← links)
- Regular expression star-freeness is PSPACE-complete (Q2763598) (← links)
- A Compact Proof of Decidability for Regular Expression Equivalence (Q2914749) (← links)
- A Decision Procedure for Regular Expression Equivalence in Type Theory (Q3100207) (← links)