2018/01/16 by Shabana, Hanan, Volkov, Mikhail V.
#68Q45 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
paper · doi:10.48550/arxiv.1801.05391
We approach the problem of computing a D3-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.