Mikhail V. Berlinkov

Publication Activity (10 Years)

Years Active: 2009-2021
Publications (10 Years): 10

Top Topics

Optimum Path Forest

Deterministic Finite Automata

Top Venues

Int. J. Found. Comput. Sci.

Developments in Language Theory

Publications

Mikhail V. Berlinkov, Robert Ferens, Marek Szykula
Preimage problems for deterministic finite automata. J. Comput. Syst. Sci. 115 (2021)
Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula
Synchronizing Strongly Connected Partial DFAs. STACS (2021)
Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula
Synchronizing Strongly Connected Partial DFAs. CoRR (2021)
Mikhail V. Berlinkov, Cyril Nicaud
Synchronizing Almost-Group Automata. Int. J. Found. Comput. Sci. 31 (8) (2020)
Mikhail V. Berlinkov, Cyril Nicaud
Synchronizing Random Almost-Group Automata. CoRR (2018)
Mikhail V. Berlinkov, Cyril Nicaud
Synchronizing Random Almost-Group Automata. CIAA (2018)
Mikhail V. Berlinkov, Robert Ferens, Marek Szykula
Complexity of Preimage Problems for Deterministic Finite Automata. MFCS (2018)
Mikhail V. Berlinkov, Robert Ferens, Marek Szykula
Extending word problems in deterministic finite automata. CoRR (2017)
Mikhail V. Berlinkov
On the Probability of Being Synchronizable. CALDAM (2016)
Mikhail V. Berlinkov, Marek Szykula
Algebraic synchronization criterion and computing reset words. Inf. Sci. 369 (2016)
Mikhail V. Berlinkov
Highest Trees of Random Mappings. CoRR (2015)
Mikhail V. Berlinkov, Marek Szykula
Algebraic Synchronization Criterion and Computing Reset Words. MFCS (1) (2015)
Mikhail V. Berlinkov, Marek Szykula
Computing Reset Words for Prefix Codes and Various Classes of Synchronizing Automata. CoRR (2014)
Mikhail V. Berlinkov
On the Synchronization Rate for e-machines. CoRR (2014)
Mikhail V. Berlinkov
On Two Algorithmic Problems about Synchronizing Automata - (Short Paper). Developments in Language Theory (2014)
Mikhail V. Berlinkov
Approximating the Minimum Length of Synchronizing Words Is Hard. Theory Comput. Syst. 54 (2) (2014)
Mikhail V. Berlinkov
Testing for Synchronization. CoRR (2014)
Mikhail V. Berlinkov
On two Algorithmic Problems about Synchronizing Automata. CoRR (2013)
Mikhail V. Berlinkov
Synchronizing quasi-Eulerian and quasi-One-Cluster Automata. Int. J. Found. Comput. Sci. 24 (6) (2013)
Mikhail V. Berlinkov
On the probability to be synchronizable CoRR (2013)
Mikhail V. Berlinkov
Synchronizing Automata on Quasi Eulerian Digraph CoRR (2012)
Mikhail V. Berlinkov
Synchronizing Automata on Quasi-Eulerian Digraph. CIAA (2012)
Marie-Pierre Béal, Mikhail V. Berlinkov, Dominique Perrin
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. Int. J. Found. Comput. Sci. 22 (2) (2011)
Mikhail V. Berlinkov
On a Conjecture by carpi and d'alessandro. Int. J. Found. Comput. Sci. 22 (7) (2011)
Mikhail V. Berlinkov
On a Conjecture by Carpi and D'Alessandro. Developments in Language Theory (2010)
Mikhail V. Berlinkov
Approximating the Minimum Length of Synchronizing Words Is Hard. CSR (2010)
Mikhail V. Berlinkov
On calculating length of minimal synchronizing words CoRR (2009)
Mikhail V. Berlinkov
Extension Method and The Cerny Conjecture CoRR (2009)