The following pages link to (Q4036599):
Displaying 18 items.
- Compression of finite-state automata through failure transitions (Q300258) (← links)
- Minimal consistent DFA revisited (Q306711) (← links)
- The tractability frontier for NFA minimization (Q414869) (← links)
- Minimizing finite automata is computationally hard (Q703578) (← links)
- Optimal state reductions of automata with partially specified behaviors (Q728283) (← links)
- An approximation algorithm for state minimization in 2-MDFAs (Q855011) (← links)
- A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
- The parallel complexity of finite-state automata problems (Q1186807) (← links)
- The state complexities of some basic operations on regular languages (Q1318694) (← links)
- Descriptional and computational complexity of the circuit representation of finite automata (Q1647686) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
- An algorithm for optimal representation of a nondeterministic finite automaton by a set-union knapsack problem (Q2754541) (← links)
- Büchi Automata Can Have Smaller Quotients (Q3012925) (← links)
- The intersection problem for finite monoids (Q3304129) (← links)
- THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET (Q3988841) (← links)
- (Q4452078) (← links)
- (Q4625701) (← links)