An upper bound for transforming self-verifying automata into deterministic onesIra Assent and Sebastian SeibertRAIRO-Theor. Inf. Appl., 41 3 (2007) 261-265DOI: https://doi.org/10.1051/ita:2007017
