An upper bound for transforming self-verifying automata into deterministic ones
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 41 (2007) no. 3, pp. 261-265.

Voir la notice de l'article dans Numdam

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(2 n n).

DOI : 10.1051/ita:2007017
Classification : 68Q10, 68Q19
Mots-clés : self-verifying nondeterministic automata, descriptional complexity, power set construction 
@article{ITA_2007__41_3_261_0,
     author = {Assent, Ira and Seibert, Sebastian},
     title = {An upper bound for transforming self-verifying automata into deterministic ones},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {261--265},
     publisher = {EDP-Sciences},
     volume = {41},
     number = {3},
     year = {2007},
     doi = {10.1051/ita:2007017},
     zbl = {1130.68067},
     mrnumber = {2354357},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2007017/}
}
TY  - JOUR
AU  - Assent, Ira
AU  - Seibert, Sebastian
TI  - An upper bound for transforming self-verifying automata into deterministic ones
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2007
SP  - 261
EP  - 265
VL  - 41
IS  - 3
PB  - EDP-Sciences
UR  - https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2007017/
DO  - 10.1051/ita:2007017
LA  - en
ID  - ITA_2007__41_3_261_0
ER  - 
%0 Journal Article
%A Assent, Ira
%A Seibert, Sebastian
%T An upper bound for transforming self-verifying automata into deterministic ones
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2007
%P 261-265
%V 41
%N 3
%I EDP-Sciences
%U https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2007017/
%R 10.1051/ita:2007017
%G en
%F ITA_2007__41_3_261_0
Assent, Ira; Seibert, Sebastian. An upper bound for transforming self-verifying automata into deterministic ones. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 41 (2007) no. 3, pp. 261-265. doi : 10.1051/ita:2007017. https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2007017/

Cité par Sources :