Mikhail V. Berlinkov

Available identifiers

Publication	Date of Publication	Type
Complexity of preimage problems for deterministic finite automata	2021-08-04	Paper
Synchronizing almost-group automata	2021-04-19	Paper
A note on polynomial approximation of synchronizing optimal coloring	2021-02-15	Paper
Synchronizing Strongly Connected Partial DFAs	2021-01-13	Paper
Preimage problems for deterministic finite automata	2020-10-23	Paper
Algebraic synchronization criterion and computing reset words	2020-01-06	Paper
Synchronizing random almost-group automata	2018-11-07	Paper
Approximating the minimum length of synchronizing words is hard	2017-11-07	Paper
On the probability of being synchronizable	2016-03-23	Paper
Algebraic synchronization criterion and computing reset words	2015-09-16	Paper
Highest Trees of Random Mappings	2015-04-17	Paper
On two algorithmic problems about synchronizing automata (short paper)	2014-10-14	Paper
Synchronizing quasi-Eulerian and quasi-one-cluster automata	2014-03-10	Paper
Synchronizing automata on quasi-Eulerian digraph	2012-09-20	Paper
On a conjecture by Carpi and D'Alessandro	2012-08-29	Paper
A quadratic upper bound on the size of a synchronizing word in one-cluster automata	2011-03-30	Paper
On a conjecture by Carpi and D'Alessandro	2010-08-31	Paper
Approximating the minimum length of synchronizing words is hard	2010-06-22	Paper

This page was built for person: Mikhail V. Berlinkov