The following pages link to (Q2754144):
Displaying 7 items.
- The tractability frontier for NFA minimization (Q414869) (← links)
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (Q3526417) (← links)
- Left is Better Than Right for Reducing Nondeterminism of NFAs (Q6114834) (← links)
