Using SAT solvers for synchronization issues in non-deterministic automata
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 15 (2018), pp. 1426-1442

Voir la notice de l'article provenant de la source Math-Net.Ru

We approach the problem of computing a $D_{3}$-synchronizing word of minimum length for a given nondeterministic automaton via its encoding as an instance of SAT and invoking a SAT solver. We also present some experimental results.
Keywords: nondeterministic automaton, synchronizing word, SAT, SAT-solver, random automaton.
@article{SEMR_2018_15_a79,
     author = {H. Shabana and M. V. Volkov},
     title = {Using {SAT} solvers for synchronization issues in non-deterministic automata},
     journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
     pages = {1426--1442},
     publisher = {mathdoc},
     volume = {15},
     year = {2018},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SEMR_2018_15_a79/}
}
TY  - JOUR
AU  - H. Shabana
AU  - M. V. Volkov
TI  - Using SAT solvers for synchronization issues in non-deterministic automata
JO  - Sibirskie èlektronnye matematičeskie izvestiâ
PY  - 2018
SP  - 1426
EP  - 1442
VL  - 15
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SEMR_2018_15_a79/
LA  - en
ID  - SEMR_2018_15_a79
ER  - 
%0 Journal Article
%A H. Shabana
%A M. V. Volkov
%T Using SAT solvers for synchronization issues in non-deterministic automata
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2018
%P 1426-1442
%V 15
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SEMR_2018_15_a79/
%G en
%F SEMR_2018_15_a79
H. Shabana; M. V. Volkov. Using SAT solvers for synchronization issues in non-deterministic automata. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 15 (2018), pp. 1426-1442. http://geodesic.mathdoc.fr/item/SEMR_2018_15_a79/