Mikhail V. Berlinkov

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