Bjørn Kjos-Hanssen

Look up the nondeterministic automaton complexity of a binary string of length at most 6.This material is based upon work supported by the National Sc …

Using autocomplete, look up nondeterministic automaton complexity (including proofs) of binary strings.This material is based upon work supported by t …