D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA
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...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin, Krasovskii Institute of Mathematics and Mechanics
2018-12-01
|
| Sarja: | Ural Mathematical Journal |
| Aiheet: | |
| Linkit: | https://umjuran.ru/index.php/umj/article/view/136 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|