User:Pngdeity/Fooling set

In set theory for a regular language, a fooling set is "a special set of pairs of strings whose size provides a lower bound on the number of states in any nondeterministic finite automaton accepting this language."