![]() | ![]() |
| 2012 | ||
|---|---|---|
| 8 | Mikhail V. Berlinkov: Synchronizing Automata on Quasi Eulerian Digraph CoRR abs/1203.3402: (2012) | |
| 7 | Mikhail V. Berlinkov: The Cerny Conjecture CoRR abs/1204.0856: (2012) | |
| 2011 | ||
| 6 | 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): 277-288 (2011) | |
| 5 | Mikhail V. Berlinkov: On a Conjecture by carpi and d'alessandro. Int. J. Found. Comput. Sci. 22(7): 1565-1576 (2011) | |
| 2010 | ||
| 4 | Mikhail V. Berlinkov: Approximating the Minimum Length of Synchronizing Words Is Hard. CSR 2010: 37-47 | |
| 3 | Mikhail V. Berlinkov: On a Conjecture by Carpi and D'Alessandro. Developments in Language Theory 2010: 66-75 | |
| 2009 | ||
| 2 | Mikhail V. Berlinkov: On calculating length of minimal synchronizing words CoRR abs/0909.3787: (2009) | |
| 1 | Mikhail V. Berlinkov: Extension Method and The Cerny Conjecture CoRR abs/0909.3790: (2009) | |
| 1 | Marie-Pierre Béal | [6] |
| 2 | Dominique Perrin | [6] |
Data released under the ODC-BY 1.0 license — See also our legal information page