1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.FL2020
Careful synchronization of partial deterministic finite automata
Hanan Shabana, Mikhail Volkov
We approach the task of computing a carefully synchronizing word of optimum length for a given partial deterministic automaton, encoding the problem as an instance of SAT and invok…
cs.FL2019
Using Sat solvers for synchronization issues in partial deterministic automata
Hanan Shabana, Mikhail V. Volkov
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 invok…
cs.FL2018★ 1 cited
Using Sat solvers for synchronization issues in non-deterministic automata
Hanan Shabana, Mikhail V. Volkov
We approach the problem of computing a -synchronizing word of minimum length for a given nondeterministic automaton via its encoding as an instance of SAT and invoking a SAT…