Pages that link to "Item:Q2343138"
From MaRDI portal
The following pages link to Checking determinism of regular expressions with counting (Q2343138):
Displaying 10 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)
- Deterministic regular expressions with back-references (Q4636631) (← links)
- (Q5111236) (← links)
- Quantitative Verification of Stochastic Regular Expressions (Q5164850) (← links)
- Regular expressions with counting: weak versus strong determinism (Q5891559) (← links)
- Regular Expressions with Counting: Weak versus Strong Determinism (Q5895105) (← links)
- Succinct determinisation of counting automata via sphere construction (Q6536322) (← links)