Back to Search
Start Over
Using Sat solvers for synchronization issues in non-deterministic automata
- Publication Year :
- 2018
-
Abstract
- 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.<br />Comment: 16 pages, 4 figures
- Subjects :
- Computer Science - Formal Languages and Automata Theory
68Q45
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1801.05391
- Document Type :
- Working Paper