D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA
oleh: Hanan Shabana
| Format: | Article |
|---|---|
| Diterbitkan: | Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin. 2018-12-01 |
Deskripsi
We approach the problem of computing a D2-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.