2000 character limit reached
Using Sat solvers for synchronization issues in non-deterministic automata
Published 16 Jan 2018 in cs.FL | (1801.05391v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.