3 citations · 5 across the 6 of their papers we have counts for
7 papers · 1 filter
Completely reachable automata: an interplay between automata, graphs, and trees
Evgeniya A. Bondar, David Casas, Mikhail V. Volkov
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely re…
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…
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…
Slowly Synchronizing Automata with Idempotent Letters of Low Rank
Mikhail Volkov
We use a semigroup-theoretic construction by Peter Higgins in order to produce, for each even , an -state and 3-letter synchronizing automaton with the following two features…
A Characterization of Completely Reachable Automata
Eugenija Bondar, Mikhail Volkov
A complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is c…
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…