Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Berlinkov, Mikhail V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximating the minimum length of synchronizing words is hard
Mikhail V. Berlinkov
Theory of Computing Systems
54
(2), 2014, pp. 211-223
Synchronizing quasi-Eulerian and quasi-one-cluster automata
Mikhail V. Berlinkov
International Journal of Foundations of Computer Science
24
(6), 2013, pp. 729-745
A quadratic upper bound on the size of a synchronizing word in one-cluster automata
Marie-Pierre Béal
,
Mikhail V. Berlinkov
,
Dominique Perrin
International Journal of Foundations of Computer Science
22
(2), 2011, pp. 277-288
On a conjecture by Carpi and D'Alessandro
Mikhail V. Berlinkov
International Journal of Foundations of Computer Science
22
(7), 2011, pp. 1565-1576
Approximating the minimum length of synchronizing words is hard
Mikhail V. Berlinkov
Lecture Notes in Computer Science
6072
, 2010, pp. 37-47