### An upper bound for transforming self-verifying automata into deterministic ones

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\left(\frac{{2}^{n}}{\sqrt{n}}\right).$