Pages that link to "Item:Q265078"
From MaRDI portal
The following pages link to Closure properties and descriptional complexity of deterministic regular expressions (Q265078):
Displaying 5 items.
- Closure properties and complexity of rational sets of regular languages (Q888431) (← links)
- Closure and nonclosure properties of the classes of compressible and rankable sets (Q2037201) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Definability by Weakly Deterministic Regular Expressions with Counters is Decidable (Q2946353) (← links)
- (Q5744635) (← links)