|
This article is cited in 3 scientific papers (total in 3 papers)
$D_2$-synchronization in nondeterministic automata
Hanan Shabanaab a 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.
Citation:
Hanan Shabana, “$D_2$-synchronization in nondeterministic automata”, Ural Math. J., 4:2 (2018), 99–110
Linking options:
https://www.mathnet.ru/eng/umj67 https://www.mathnet.ru/eng/umj/v4/i2/p99
|
Statistics & downloads: |
Abstract page: | 210 | Full-text PDF : | 288 | References: | 43 |
|