We stand with Ukraine  

Mikhail V. Berlinkov

Orcid: 0000-0002-3903-0130

According to our database1, Mikhail V. Berlinkov authored at least 22 papers between 2009 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Preimage problems for deterministic finite automata.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
,
Robert Ferens
,
Marek Szykula
J. Comput. Syst. Sci., 2021

Synchronizing Strongly Connected Partial DFAs.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
,
Robert Ferens
,
Andrew Ryzhikov
,
Marek Szykula
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2020
Synchronizing Almost-Group Automata.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
,
Cyril Nicaud
Int. J. Found. Comput. Sci., 2020

2018
Synchronizing Random Almost-Group Automata.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
,
Cyril Nicaud
Proceedings of the Implementation and Application of Automata, 2018

Complexity of Preimage Problems for Deterministic Finite Automata.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
,
Robert Ferens
,
Marek Szykula
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Extending word problems in deterministic finite automata.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
,
Robert Ferens
,
Marek Szykula
CoRR, 2017

2016
Algebraic synchronization criterion and computing reset words.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
,
Marek Szykula
Inf. Sci., 2016

On the Probability of Being Synchronizable.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015
Highest Trees of Random Mappings.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
CoRR, 2015

2014
Approximating the Minimum Length of Synchronizing Words Is Hard.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
Theory Comput. Syst., 2014

Computing Reset Words for Prefix Codes and Various Classes of Synchronizing Automata.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
,
Marek Szykula
CoRR, 2014

On the Synchronization Rate for e-machines.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
CoRR, 2014

Testing for Synchronization.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
CoRR, 2014

On Two Algorithmic Problems about Synchronizing Automata - (Short Paper).
[BibTeX]
[DOI]
Mikhail V. Berlinkov
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013
Synchronizing quasi-Eulerian and quasi-One-Cluster Automata.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
Int. J. Found. Comput. Sci., 2013

On the probability to be synchronizable
[BibTeX]
[DOI]
Mikhail V. Berlinkov
CoRR, 2013

On two Algorithmic Problems about Synchronizing Automata.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
CoRR, 2013

2012
Synchronizing Automata on Quasi-Eulerian Digraph.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
Proceedings of the Implementation and Application of Automata, 2012

2011
On a Conjecture by carpi and d'alessandro.
[BibTeX]
[DOI]
Mikhail V. Berlinkov
Int. J. Found. Comput. Sci., 2011

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

2009
Extension Method and The Cerny Conjecture
[BibTeX]
[DOI]
Mikhail V. Berlinkov
CoRR, 2009

On calculating length of minimal synchronizing words
[BibTeX]
[DOI]
Mikhail V. Berlinkov
CoRR, 2009


  Loading...