3 research outputs found
Using Sat solvers for synchronization issues in partial deterministic automata
We approach the task of computing a carefully synchronizing word of minimum
length for a given partial deterministic automaton, encoding the problem as an
instance of SAT and invoking a SAT solver. Our experimental results demonstrate
that this approach gives satisfactory results for automata with up to 100
states even if very modest computational resources are used.Comment: 15 pages, 3 figure