An upper bound for transforming self-verifying automata into deterministic ones
Ira Assent, Sebastian Seibert · RAIRO - Theoretical Informatics and Applications · 2007
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 to