The following pages link to (Q4452078):
Displaying 8 items.
- Compression of finite-state automata through failure transitions (Q300258) (← links)
- A graph theoretic approach to automata minimality (Q418805) (← links)
- String execution time for finite languages: max is easy, min is hard (Q642653) (← links)
- Minimizing finite automata is computationally hard (Q703578) (← links)
- A maxmin problem on finite automata (Q1116710) (← links)
- (Q3832058) (← links)
- (Q4036599) (← links)
- (Q5418252) (← links)