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.