3 citations · 5 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
Inductive groupoids and cross-connections of regular semigroups
P. A. Azeef Muhammed, M. V. Volkov
There are two major structure theorems for an arbitrary regular semigroup using categories, both due to Nambooripad. The first construction using inductive groupoids departs from t…
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…