For every n≥4, an explicit n-state two-way nondeterministic finite automaton has a complement requiring at least ½·2^⌊(n−4)/127⌋−1 states in any two-way nondeterministic finite automaton.
For every n≥4, an explicit n-state two-way nondeterministic finite automaton has a complement requiring at least ½·2^⌊(n−4)/127⌋−1 states in any two-way nondeterministic finite automaton.
For every n≥4, an explicit n-state two-way nondeterministic finite automaton has a complement requiring at least ½·2^⌊(n−4)/127⌋−1 states in any two-way nondeterministic finite automaton.
If correct, rules out a polynomial complementation state bound uniform over finite alphabets.
Can every two-way nondeterministic automaton be complemented with polynomially many states?
Publication dates and editorial changes.
OpenAI reports exponential state cost for two-way NFA complementation
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
