Pages that link to "Item:Q5895105"
From MaRDI portal
The following pages link to Regular Expressions with Counting: Weak versus Strong Determinism (Q5895105):
Displaying 6 items.
- Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking (Q391129) (← links)
- The tractability frontier for NFA minimization (Q414869) (← links)
- Checking determinism of regular expressions with counting (Q2343138) (← links)
- Regular Expressions with Numerical Constraints and Automata with Counters (Q3393412) (← links)
- Regular expressions with counting: weak versus strong determinism (Q5891559) (← links)
- Succinct determinisation of counting automata via sphere construction (Q6536322) (← links)