Using Sat solvers for synchronization issues in non-deterministic automata
classification
💻 cs.FL
keywords
approachautomataautomatoncomputingencodingexperimentalgiveninstance
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.