Pages that link to "Item:Q493651"
From MaRDI portal
The following pages link to Deciding determinism of regular languages (Q493651):
Displaying 6 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- (Q5111236) (← links)
