The following pages link to Sylvie Davies (Q777985):
Displaying 12 items.
- Most complex deterministic union-free regular languages (Q777986) (← links)
- A new technique for reachability of states in concatenation automata (Q777990) (← links)
- State complexity of reversals of deterministic finite automata with output (Q1616967) (← links)
- A general approach to state complexity of operations: formalization and limitations (Q1622968) (← links)
- State complexity of single-word pattern matching in regular languages (Q2179329) (← links)
- Square, power, positive closure, and complementation on star-free languages (Q2179330) (← links)
- Primitivity, uniform minimality, and state complexity of Boolean operations (Q2322701) (← links)
- Most complex non-returning regular languages (Q2400992) (← links)
- State complexity of pattern matching in regular languages (Q2422023) (← links)
- Quotient Complexities of Atoms in Regular Ideal Languages (Q2803047) (← links)
- (Q2965987) (← links)
- Most Complex Non-Returning Regular Languages (Q5205037) (← links)
