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}}).$