Collapsing Words vs. Synchronizing Words. - Dimitry S. Ananichev; Mikhail V. Volkov 001 (Developments in Language Theory, 2001)

An Inverse Automata Algorithm for Recognizing 2-Collapsing Words. - Dimitry S. Ananichev; Alessandra Cherubini; Mikhail V. Volkov 001 (Developments in Language Theory, 2002)

Image reducing words and subgroups of free groups. - Dimitry S. Ananichev; Alessandra Cherubini; Mikhail V. Volkov 001 (Theor. Comput. Sci., 2003)

Synchronizing monotonic automata. - Dimitry S. Ananichev; Mikhail V. Volkov 001 (Theor. Comput. Sci., 2004)

The Mortality Threshold for Partially Monotonic Automata. - Dimitry S. Ananichev (Developments in Language Theory, 2005)

Synchronizing generalized monotonic automata. - Dimitry S. Ananichev; Mikhail V. Volkov 001 (Theor. Comput. Sci., 2005)

Collapsing Words: a Progress Report. - Dimitry S. Ananichev; Ilja V. Petrov; Mikhail V. Volkov 001 (Int. J. Found. Comput. Sci., 2006)

Synchronizing automata with a letter of deficiency 2. - Dimitry S. Ananichev; Mikhail V. Volkov 001; Yu. I. Zaks (Theor. Comput. Sci., 2007)

Slowly Synchronizing Automata and Digraphs. - Dimitry S. Ananichev; Vladimir V. Gusev; Mikhail V. Volkov 001 (MFCS, 2010)

Primitive digraphs with large exponents and slowly synchronizing automata - Dimitry S. Ananichev; Vladimir V. Gusev; Mikhail V. Volkov 001 (CoRR, 2013)

Approximation of Reset Thresholds with Greedy Algorithms. - Dimitry S. Ananichev; Vladimir V. Gusev (Fundam. Informaticae, 2016)

A new lower bound for reset threshold of synchronizing automata with sink state. - Dimitry S. Ananichev (CoRR, 2017)

A new Lower Bound for Reset Threshold of Binary Synchronizing Automata with Sink. - Dmitry S. Ananichev; Vojtech Vorel (J. Autom. Lang. Comb., 2019)