Mikhail V. Volkov

According to our database, Mikhail V. Volkov authored at least 52 papers between 1995 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Synchronization of Primitive Automata.

Mikhail V. Volkov

RAIRO Theor. Informatics Appl., 2024

2023

Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees.

Eugenija A. Bondar, David Casas, Mikhail V. Volkov

Int. J. Found. Comput. Sci., September, 2023

Preface of the Special Issue Dedicated to Selected Papers from CSR 2020.

Henning Fernau, Mikhail V. Volkov

Theory Comput. Syst., April, 2023

Cross-connection structure of locally inverse semigroups.

P. A. Azeef Muhammed, Mikhail V. Volkov, Karl Auinger

Int. J. Algebra Comput., February, 2023

Don's conjecture for binary completely reachable automata: an approach and its limitations.

David Casas, Mikhail V. Volkov

CoRR, 2023

2022

Identities in twisted Brauer monoids.

Nikita V. Kitov, Mikhail V. Volkov

CoRR, 2022

Completely reachable automata: an interplay between automata, graphs, and trees.

Evgeniya A. Bondar, David Casas, Mikhail V. Volkov

CoRR, 2022

Careful synchronization of partial deterministic finite automata.

Hanan Shabana, Mikhail V. Volkov

Acta Informatica, 2022

Binary Completely Reachable Automata.

David Casas, Mikhail V. Volkov

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Cerný's conjecture and the road colouring problem.

Jarkko Kari, Mikhail V. Volkov

Proceedings of the Handbook of Automata Theory., 2021

2020

Optimal synchronization of partial deterministic finite automata.

Hanan Shabana, Mikhail V. Volkov

CoRR, 2020

Identities of the Kauffman Monoid <i>K</i>₄ and of the Jones Monoid <i>J</i>₄.

Nikita V. Kitov, Mikhail V. Volkov

Proceedings of the Fields of Logic and Computation III, 2020

2019

Slowly Synchronizing Automata with Idempotent Letters of Low Rank.

Mikhail V. Volkov

J. Autom. Lang. Comb., 2019

Preface.

Mikhail V. Volkov

J. Autom. Lang. Comb., 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

Int. J. Found. Comput. Sci., 2019

The Salomaa Prize 2019 was given to Dr. Artur Jez.

Mikhail V. Volkov, Juhani Karhumäki, Dominique Perrin

Bull. EATCS, 2019

Identities of the Kauffman Monoid K₄ and of the Jones monoid J₄.

Nikita V. Kitov, Mikhail V. Volkov

CoRR, 2019

Using Sat Solvers for Synchronization Issues in Partial Deterministic Automata.

Hanan Shabana, Mikhail V. Volkov

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Computational Complexity of Synchronization under Regular Constraints.

Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, Petra Wolf

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Perface.

Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich, Mikhail V. Volkov

Fundam. Informaticae, 2018

The Salomaa Prize 2018 was given to Dr. Jean-Éric Pin.

Juhani Karhumäki, Dominique Perrin, Mikhail V. Volkov

Bull. EATCS, 2018

Using Sat solvers for synchronization issues in non-deterministic automata.

Hanan Shabana, Mikhail V. Volkov

CoRR, 2018

A Characterization of Completely Reachable Automata.

Eugenija A. Bondar, Mikhail V. Volkov

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

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

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016

Completely Reachable Automata.

Eugenija A. Bondar, Mikhail V. Volkov

Proceedings of the Descriptional Complexity of Formal Systems, 2016

2013

P(L)Aying for Synchronization.

Fedor M. Fominykh, Pavel V. Martyugin, Mikhail V. Volkov

Int. J. Found. Comput. Sci., 2013

Primitive digraphs with large exponents and slowly synchronizing automata

Dimitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov

CoRR, 2013

2012

P(l)aying for Synchronization.

Fedor M. Fominykh, Mikhail V. Volkov

Proceedings of the Implementation and Application of Automata, 2012

2011

Limit Varieties Generated by Completely 0-Simple Semigroups.

Edmond W. H. Lee, Mikhail V. Volkov

Int. J. Algebra Comput., 2011

2010

Periodic Elements of the Free Idempotent Generated Semigroup on a Biordered Set.

David Easdown, Mark V. Sapir, Mikhail V. Volkov

Int. J. Algebra Comput., 2010

A minimal nonfinitely based semigroup whose variety is polynomially recognizable

Mikhail V. Volkov, Svetlana V. Goldberg, Stanislav I. Kublanovsky

CoRR, 2010

Slowly Synchronizing Automata and Digraphs.

Dimitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion.

Marcel Jackson, Mikhail V. Volkov

Proceedings of the Fields of Logic and Computation, 2010

2009

Synchronizing automata preserving a chain of partial orders.

Mikhail V. Volkov

Theor. Comput. Sci., 2009

Pattern avoidance by palindromes.

I. A. Mikhailova, Mikhail V. Volkov

Theor. Comput. Sci., 2009

2008

Synchronizing Automata and the Cerny Conjecture.

Mikhail V. Volkov

Proceedings of the Language and Automata Theory and Applications, 2008

2007

Synchronizing automata with a letter of deficiency 2.

Dimitry S. Ananichev, Mikhail V. Volkov, Yu. I. Zaks

Theor. Comput. Sci., 2007

2006

Collapsing Words: a Progress Report.

Dimitry S. Ananichev, Ilja V. Petrov, Mikhail V. Volkov

Int. J. Found. Comput. Sci., 2006

Subword Complexity of Profinite Words and Subgroups of Free Profinite Semigroups.

Jorge Almeida, Mikhail V. Volkov

Int. J. Algebra Comput., 2006

2005

Synchronizing generalized monotonic automata.

Dimitry S. Ananichev, Mikhail V. Volkov

Theor. Comput. Sci., 2005

The pseudovariety of semigroups of triangular matrices over a finite field.

Jorge Almeida, Stuart W. Margolis, Mikhail V. Volkov

RAIRO Theor. Informatics Appl., 2005

2004

Synchronizing monotonic automata.

Dimitry S. Ananichev, Mikhail V. Volkov

Theor. Comput. Sci., 2004

Checking quasi-identities in a finite semigroup may be computationally hard.

Mikhail V. Volkov

Stud Logica, 2004

Words Guaranteeing Minimum Image.

Stuart W. Margolis, Jean-Eric Pin, Mikhail V. Volkov

Int. J. Found. Comput. Sci., 2004

Reflexive Relations, Extensive Transformations and Piecewise Testable Languages of a Given Height.

Mikhail V. Volkov

Int. J. Algebra Comput., 2004

2003

Image reducing words and subgroups of free groups.

Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov

Theor. Comput. Sci., 2003

2002

An Inverse Automata Algorithm for Recognizing 2-Collapsing Words.

Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001

The Gap Between Partial and Full: an Addendum.

Jorge Almeida, Peter M. Higgins, Mikhail V. Volkov

Int. J. Algebra Comput., 2001

Collapsing Words vs. Synchronizing Words.

Dimitry S. Ananichev, Mikhail V. Volkov

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000

Words Guaranteeing Minimal Image.

Stuart W. Margolis, Jean-Eric Pin, Mikhail V. Volkov

Proceedings of the International Colloquium on Words, 2000

1998

The Gap Between Partial and Full.

Jorge Almeida, Mikhail V. Volkov

Int. J. Algebra Comput., 1998

1995

On a Class of Semigroup Pseudovarieties without Finite Pseudoidentity Basis.

Mikhail V. Volkov

Int. J. Algebra Comput., 1995