On a Class of Semigroup Pseudovarieties without Finite Pseudoidentity Basis. - Mikhail V. Volkov 001 (Int. J. Algebra Comput., 1995)

The Gap Between Partial and Full. - Jorge Almeida 001; Mikhail V. Volkov 001 (Int. J. Algebra Comput., 1998)

Words Guaranteeing Minimal Image. - Stuart W. Margolis; Jean-Eric Pin; Mikhail V. Volkov 001 (Words, Languages & Combinatorics, 2000)

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

The Gap Between Partial and Full: an Addendum. - Jorge Almeida 001; Peter M. Higgins; Mikhail V. Volkov 001 (Int. J. Algebra Comput., 2001)

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

Synchronizing Monotonic Automata. - Dimitry S. Ananichev; Mikhail V. Volkov 001 (Developments in Language Theory, 2003)

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

Reflexive Relations, Extensive Transformations and Piecewise Testable Languages of a Given Height. - Mikhail V. Volkov 001 (Int. J. Algebra Comput., 2004)

Words Guaranteeing Minimum Image. - Stuart W. Margolis; Jean-Eric Pin; Mikhail V. Volkov 001 (Int. J. Found. Comput. Sci., 2004)

Checking quasi-identities in a finite semigroup may be computationally hard. - Mikhail V. Volkov 001 (Stud Logica, 2004)

Collapsing Words: A Progress Report. - Dimitry S. Ananichev; Ilja V. Petrov; Mikhail V. Volkov 001 (Developments in Language Theory, 2005)

The pseudovariety of semigroups of triangular matrices over a finite field. - Jorge Almeida 001; Stuart W. Margolis; Mikhail V. Volkov 001 (RAIRO Theor. Informatics Appl., 2005)

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

Synchronizing Automata with a Letter of Deficiency 2. - Dimitry S. Ananichev; Mikhail V. Volkov 001; Yu. I. Zaks (Developments in Language Theory, 2006)

Subword Complexity of Profinite Words and Subgroups of Free Profinite Semigroups. - Jorge Almeida 001; Mikhail V. Volkov 001 (Int. J. Algebra Comput., 2006)

Synchronizing Automata Preserving a Chain of Partial Orders. - Mikhail V. Volkov 001 (CIAA, 2007)

Synchronizing Automata and the Cerny Conjecture. - Mikhail V. Volkov 001 (LATA, 2008)

Pattern avoidance by palindromes. - I. A. Mikhailova; Mikhail V. Volkov 001 (Theor. Comput. Sci., 2009)

The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion. - Marcel Jackson; Mikhail V. Volkov 001 (Fields of Logic and Computation, 2010)

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

A minimal nonfinitely based semigroup whose variety is polynomially recognizable - Mikhail V. Volkov 001; Svetlana V. Goldberg; Stanislav I. Kublanovsky (CoRR, 2010)

Periodic Elements of the Free Idempotent Generated Semigroup on a Biordered Set. - David Easdown; Mark V. Sapir; Mikhail V. Volkov 001 (Int. J. Algebra Comput., 2010)

Limit Varieties Generated by Completely 0-Simple Semigroups. - Edmond W. H. Lee; Mikhail V. Volkov 001 (Int. J. Algebra Comput., 2011)

P(l)aying for Synchronization. - Fedor M. Fominykh; Mikhail V. Volkov 001 (CIAA, 2012)

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

P(L)Aying for Synchronization. - Fedor M. Fominykh; Pavel V. Martyugin; Mikhail V. Volkov 001 (Int. J. Found. Comput. Sci., 2013)

Completely Reachable Automata. - Eugenija A. Bondar; Mikhail V. Volkov 001 (DCFS, 2016)

On the Interplay Between Babai and Černý's Conjectures. - François Gonze; Vladimir V. Gusev; Balázs Gerencsér; Raphaël M. Jungers; Mikhail V. Volkov 001 (DLT, 2017)

A Characterization of Completely Reachable Automata. - Eugenija A. Bondar; Mikhail V. Volkov 001 (DLT, 2018)

Using Sat solvers for synchronization issues in non-deterministic automata. - Hanan Shabana; Mikhail V. Volkov 001 (CoRR, 2018)

The Salomaa Prize 2018 was given to Dr. Jean-Éric Pin. - Juhani Karhumäki; Dominique Perrin; Mikhail V. Volkov 001 (Bull. EATCS, 2018)

Perface. - Vesa Halava; Juhani Karhumäki; Yuri V. Matiyasevich; Mikhail V. Volkov 001 (Fundam. Informaticae, 2018)

Computational Complexity of Synchronization under Regular Constraints. - Henning Fernau; Vladimir V. Gusev; Stefan Hoffmann 001; Markus Holzer 001; Mikhail V. Volkov 001; Petra Wolf 002 (MFCS, 2019)

Using Sat Solvers for Synchronization Issues in Partial Deterministic Automata. - Hanan Shabana; Mikhail V. Volkov 001 (MOTOR (2), 2019)

Identities of the Kauffman Monoid K4 and of the Jones monoid J4. - Nikita V. Kitov; Mikhail V. Volkov 001 (CoRR, 2019)

The Salomaa Prize 2019 was given to Dr. Artur Jez. - Mikhail V. Volkov 001; Juhani Karhumäki; Dominique Perrin (Bull. EATCS, 2019)

On the Interplay Between Černý and Babai's Conjectures. - François Gonze; Vladimir V. Gusev; Raphaël M. Jungers; Balázs Gerencsér; Mikhail V. Volkov 001 (Int. J. Found. Comput. Sci., 2019)

Preface. - Mikhail V. Volkov 001 (J. Autom. Lang. Comb., 2019)

Slowly Synchronizing Automata with Idempotent Letters of Low Rank. - Mikhail V. Volkov 001 (J. Autom. Lang. Comb., 2019)

Identities of the Kauffman Monoid K4 and of the Jones Monoid J4. - Nikita V. Kitov; Mikhail V. Volkov 001 (Fields of Logic and Computation III, 2020)

Optimal synchronization of partial deterministic finite automata. - Hanan Shabana; Mikhail V. Volkov 001 (CoRR, 2020)

Cerný's conjecture and the road colouring problem. - Jarkko Kari 001; Mikhail V. Volkov 001 (Handbook of Automata Theory (I.), 2021)

Binary Completely Reachable Automata. - David Casas; Mikhail V. Volkov 001 (LATIN, 2022)

Careful synchronization of partial deterministic finite automata. - Hanan Shabana; Mikhail V. Volkov 001 (Acta Informatica, 2022)

Completely reachable automata: an interplay between automata, graphs, and trees. - Evgeniya A. Bondar; David Casas; Mikhail V. Volkov 001 (CoRR, 2022)

Identities in twisted Brauer monoids. - Nikita V. Kitov; Mikhail V. Volkov 001 (CoRR, 2022)

Cross-connection structure of locally inverse semigroups. - P. A. Azeef Muhammed; Mikhail V. Volkov 001; Karl Auinger (Int. J. Algebra Comput., 2023)

Preface of the Special Issue Dedicated to Selected Papers from CSR 2020. - Henning Fernau; Mikhail V. Volkov 001 (Theory Comput. Syst., 2023)

Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees. - Eugenija A. Bondar; David Casas; Mikhail V. Volkov 001 (Int. J. Found. Comput. Sci., 2023)

Winning Strategies for the Synchronization Game on Subclasses of Finite Automata. - Henning Fernau; Carolina Haase; Stefan Hoffmann 001; Mikhail Volkov 001 (NCMA, 2024)

Synchronization of Primitive Automata. - Mikhail V. Volkov 001 (RAIRO Theor. Informatics Appl., 2024)

Don's Conjecture for Binary Completely Reachable Automata: an Approach and its Limitations. - David Casas; Mikhail V. Volkov 001 (J. Autom. Lang. Comb., 2024)

Preface of the Special Issue Dedicated to Selected Papers from DLT 2022. - Volker Diekert; Mikhail Volkov 001 (Theory Comput. Syst., 2024)

List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata. - Mikhail V. Volkov 001 (CoRR, 2025)