no code implementations • 13 Jan 2021 • Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykuła
We study synchronizing partial DFAs, which extend the classical concept of synchronizing complete DFAs and are a special case of synchronizing unambiguous NFAs.
Formal Languages and Automata Theory Combinatorics
1 code implementation • 21 Apr 2013 • Mikhail V. Berlinkov
We prove that a random automaton with $n$ states and any fixed non-singleton alphabet is synchronizing with high probability.
Formal Languages and Automata Theory Discrete Mathematics Combinatorics F.4.3
