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 Science Foundation under Grant Number 0901020.
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.
9Apps 4.9
