This paper describes a modification of the power set
construction for the transformation of self-verifying
nondeterministic finite automata to deterministic ones. Using a set
counting argument, the upper bound for this transformation can be
lowered from $2^n$
to $O(\frac{2^n}{\sqrt{n}}).$![](//static-cambridge-org.ezproxyberklee.flo.org/binary/version/id/urn:cambridge.org:id:binary:20161010045934399-0208:S0988375407000173:S0988375407000173_eqnU2.gif)