Pages that link to "Item:Q2946353"
From MaRDI portal
The following pages link to Definability by Weakly Deterministic Regular Expressions with Counters is Decidable (Q2946353):
Displaying 5 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- (Q5111236) (← links)
