Pages that link to "Item:Q2909097"
From MaRDI portal
The following pages link to ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH (Q2909097):
Displayed 14 items.
- Automata for regular expressions with shuffle (Q1706150) (← links)
- On the size of partial derivatives and the word membership problem (Q2041687) (← links)
- Partial derivative automaton by compressing regular expressions (Q2096587) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) (← links)
- On the average complexity of partial derivative transducers (Q2699218) (← links)
- On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection (Q2829969) (← links)
- Prefix and Right-Partial Derivative Automata (Q3195704) (← links)
- On the Average State Complexity of Partial Derivative Transducers (Q3297766) (← links)
- ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA (Q4902888) (← links)
- (Q5061515) (← links)
- On Average Behaviour of Regular Expressions in Strong Star Normal Form (Q5205036) (← links)
- Partial derivatives of regular expressions over alphabet-invariant and user-defined labels (Q5918273) (← links)
- Random Regular Expression Over Huge Alphabets (Q6114829) (← links)