This article is cited in 3 papers

$D_2$-synchronization in nondeterministic automata

Hanan Shabana<sup>ab

a</sup> Institute of Natural Sciences and Mathematics, Ural Federal University, 51 Lenin aven., Ekaterinburg, Russia, 620000
^b Faculty of Electronic Engineering, Menoufia University, Egypt

Abstract: We approach the problem of computing a $D_2$-synchronizing word of minimum length for a given nondeterministic automaton via its encoding as an instance of SAT and invoking a SAT solver. In addition, we report some of the experimental results obtained when we had tested our method on randomly generated automata and certain benchmarks.

Keywords: Nondeterministic automata, Synchronizing word, SAT solver.

Language: English

DOI: 10.15826/umj.2018.2.011

Bibliographic databases:

• 
•