Pages that link to "Item:Q5891559"
From MaRDI portal
The following pages link to Regular Expressions with Counting: Weak versus Strong Determinism (Q5891559):
Displaying 11 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- Deciding determinism of regular languages (Q493651) (← links)
- Annotated regular expressions and input-driven languages (Q783684) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Checking determinism of regular expressions with counting (Q2343138) (← links)
- Deciding definability by deterministic regular expressions (Q2361347) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- Definability by Weakly Deterministic Regular Expressions with Counters is Decidable (Q2946353) (← links)
- (Q5111236) (← links)
- A Trichotomy for Regular Trail Queries (Q6178699) (← links)
