On calculating length of minimal synchronizing words - Mikhail V. Berlinkov (CoRR, 2009)

Extension Method and The Cerny Conjecture - Mikhail V. Berlinkov (CoRR, 2009)

A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. - Marie-Pierre Béal; Mikhail V. Berlinkov; Dominique Perrin (Int. J. Found. Comput. Sci., 2011)

On a Conjecture by carpi and d'alessandro. - Mikhail V. Berlinkov (Int. J. Found. Comput. Sci., 2011)

Synchronizing Automata on Quasi-Eulerian Digraph. - Mikhail V. Berlinkov (CIAA, 2012)

On two Algorithmic Problems about Synchronizing Automata. - Mikhail V. Berlinkov (CoRR, 2013)

On the probability to be synchronizable - Mikhail V. Berlinkov (CoRR, 2013)

Synchronizing quasi-Eulerian and quasi-One-Cluster Automata. - Mikhail V. Berlinkov (Int. J. Found. Comput. Sci., 2013)

On Two Algorithmic Problems about Synchronizing Automata - (Short Paper). - Mikhail V. Berlinkov (Developments in Language Theory, 2014)

Testing for Synchronization. - Mikhail V. Berlinkov (CoRR, 2014)

On the Synchronization Rate for e-machines. - Mikhail V. Berlinkov (CoRR, 2014)

Computing Reset Words for Prefix Codes and Various Classes of Synchronizing Automata. - Mikhail V. Berlinkov; Marek Szykula (CoRR, 2014)

Approximating the Minimum Length of Synchronizing Words Is Hard. - Mikhail V. Berlinkov (Theory Comput. Syst., 2014)

Highest Trees of Random Mappings. - Mikhail V. Berlinkov (CoRR, 2015)

On the Probability of Being Synchronizable. - Mikhail V. Berlinkov (CALDAM, 2016)

Algebraic synchronization criterion and computing reset words. - Mikhail V. Berlinkov; Marek Szykula (Inf. Sci., 2016)

Extending word problems in deterministic finite automata. - Mikhail V. Berlinkov; Robert Ferens; Marek Szykula (CoRR, 2017)

Complexity of Preimage Problems for Deterministic Finite Automata. - Mikhail V. Berlinkov; Robert Ferens; Marek Szykula (MFCS, 2018)

Synchronizing Random Almost-Group Automata. - Mikhail V. Berlinkov; Cyril Nicaud (CIAA, 2018)

Synchronizing Almost-Group Automata. - Mikhail V. Berlinkov; Cyril Nicaud (Int. J. Found. Comput. Sci., 2020)

Synchronizing Strongly Connected Partial DFAs. - Mikhail V. Berlinkov; Robert Ferens; Andrew Ryzhikov; Marek Szykula (STACS, 2021)

Preimage problems for deterministic finite automata. - Mikhail V. Berlinkov; Robert Ferens; Marek Szykula (J. Comput. Syst. Sci., 2021)