default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikhail V. Volkov 0001
Person information
- affiliation: Ural Federal University, Ekaterinburg, Institute of Mathematics and Computer Science, Russia
Other persons with the same name
- Mikhail Volkov — disambiguation page
- Mikhail Volkov 0002 — Massachusetts Institute of Technology (MIT), Computer Science and Artificial Intelligence Lab
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Mikhail V. Volkov
:
Synchronization of Primitive Automata. RAIRO Theor. Informatics Appl. 58: 3 (2024)- [j29]Volker Diekert, Mikhail Volkov:
Preface of the Special Issue Dedicated to Selected Papers from DLT 2022. Theory Comput. Syst. 68(3): 299-300 (2024) - [c19]Henning Fernau, Carolina Haase, Stefan Hoffmann, Mikhail Volkov:
Winning Strategies for the Synchronization Game on Subclasses of Finite Automata. NCMA 2024: 77-85 - 2023
- [j28]P. A. Azeef Muhammed, Mikhail V. Volkov, Karl Auinger:
Cross-connection structure of locally inverse semigroups. Int. J. Algebra Comput. 33(1): 123-159 (2023) - [j27]Eugenija A. Bondar, David Casas, Mikhail V. Volkov:
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees. Int. J. Found. Comput. Sci. 34(6): 655-690 (2023) - [j26]Henning Fernau, Mikhail V. Volkov:
Preface of the Special Issue Dedicated to Selected Papers from CSR 2020. Theory Comput. Syst. 67(2): 219-220 (2023) - [e4]Frank Drewes, Mikhail Volkov:
Developments in Language Theory - 27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023, Proceedings. Lecture Notes in Computer Science 13911, Springer 2023, ISBN 978-3-031-33263-0 [contents] - [i17]Mikhail Volkov:
Synchronization of primitive automata. CoRR abs/2306.13317 (2023) - [i16]David Casas, Mikhail V. Volkov:
Don's conjecture for binary completely reachable automata: an approach and its limitations. CoRR abs/2311.00077 (2023) - 2022
- [j25]Hanan Shabana, Mikhail V. Volkov:
Careful synchronization of partial deterministic finite automata. Acta Informatica 59(4): 479-504 (2022) - [c18]David Casas, Mikhail V. Volkov:
Binary Completely Reachable Automata. LATIN 2022: 345-358 - [e3]Volker Diekert, Mikhail V. Volkov:
Developments in Language Theory - 26th International Conference, DLT 2022, Tampa, FL, USA, May 9-13, 2022, Proceedings. Lecture Notes in Computer Science 13257, Springer 2022, ISBN 978-3-031-05577-5 [contents] - [i15]Evgeniya A. Bondar, David Casas, Mikhail V. Volkov:
Completely reachable automata: an interplay between automata, graphs, and trees. CoRR abs/2201.05075 (2022) - [i14]David Casas, Mikhail V. Volkov:
Binary completely reachable automata. CoRR abs/2205.09404 (2022) - [i13]Nikita V. Kitov, Mikhail V. Volkov:
Identities in twisted Brauer monoids. CoRR abs/2208.00484 (2022) - 2021
- [p1]Jarkko Kari, Mikhail V. Volkov:
Cerný's conjecture and the road colouring problem. Handbook of Automata Theory (I.) 2021: 525-565 - 2020
- [c17]Nikita V. Kitov, Mikhail V. Volkov:
Identities of the Kauffman Monoid K4 and of the Jones Monoid J4. Fields of Logic and Computation III 2020: 156-178 - [i12]Hanan Shabana, Mikhail V. Volkov:
Optimal synchronization of partial deterministic finite automata. CoRR abs/2002.01045 (2020)
2010 – 2019
- 2019
- [j24]Mikhail V. Volkov, Juhani Karhumäki, Dominique Perrin:
The Salomaa Prize 2019 was given to Dr. Artur Jez. Bull. EATCS 129 (2019) - [j23]François Gonze, Vladimir V. Gusev, Raphaël M. Jungers, Balázs Gerencsér, Mikhail V. Volkov:
On the Interplay Between Černý and Babai's Conjectures. Int. J. Found. Comput. Sci. 30(1): 93-114 (2019) - [j22]Mikhail V. Volkov:
Preface. J. Autom. Lang. Comb. 24(2-4): 119-121 (2019) - [j21]Mikhail V. Volkov:
Slowly Synchronizing Automata with Idempotent Letters of Low Rank. J. Autom. Lang. Comb. 24(2-4): 375-386 (2019) - [c16]Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, Petra Wolf:
Computational Complexity of Synchronization under Regular Constraints. MFCS 2019: 63:1-63:14 - [c15]Hanan Shabana, Mikhail V. Volkov:
Using Sat Solvers for Synchronization Issues in Partial Deterministic Automata. MOTOR (2) 2019: 103-118 - [i11]Hanan Shabana, Mikhail V. Volkov:
Using Sat solvers for synchronization issues in partial deterministic automata. CoRR abs/1903.10549 (2019) - [i10]Nikita V. Kitov, Mikhail V. Volkov:
Identities of the Kauffman Monoid K4 and of the Jones monoid J4. CoRR abs/1910.09190 (2019) - 2018
- [j20]Juhani Karhumäki, Dominique Perrin, Mikhail V. Volkov:
The Salomaa Prize 2018 was given to Dr. Jean-Éric Pin. Bull. EATCS 126 (2018) - [j19]Vesa Halava, Juhani Karhumäki, Yuri V. Matiyasevich, Mikhail V. Volkov:
Perface. Fundam. Informaticae 162(2-3): i (2018) - [c14]Eugenija A. Bondar, Mikhail V. Volkov:
A Characterization of Completely Reachable Automata. DLT 2018: 145-155 - [i9]Hanan Shabana, Mikhail V. Volkov:
Using Sat solvers for synchronization issues in non-deterministic automata. CoRR abs/1801.05391 (2018) - [i8]Eugenija A. Bondar, Mikhail V. Volkov:
A Characterization of Completely Reachable Automata. CoRR abs/1805.02879 (2018) - [i7]Mikhail V. Volkov:
Slowly Synchronizing Automata with Idempotent Letters of Low Rank. CoRR abs/1807.07048 (2018) - 2017
- [c13]François Gonze, Vladimir V. Gusev, Balázs Gerencsér, Raphaël M. Jungers, Mikhail V. Volkov:
On the Interplay Between Babai and Černý's Conjectures. DLT 2017: 185-197 - [i6]François Gonze, Vladimir V. Gusev, Balázs Gerencsér, Raphaël M. Jungers, Mikhail V. Volkov:
On the interplay between Babai and Černý's conjectures. CoRR abs/1704.04047 (2017) - 2016
- [c12]Eugenija A. Bondar, Mikhail V. Volkov:
Completely Reachable Automata. DCFS 2016: 1-17 - [i5]Eugenija A. Bondar, Mikhail V. Volkov:
Completely Reachable Automata. CoRR abs/1607.00554 (2016) - 2014
- [e2]Arseny M. Shur, Mikhail V. Volkov:
Developments in Language Theory - 18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings. Lecture Notes in Computer Science 8633, Springer 2014, ISBN 978-3-319-09697-1 [contents] - 2013
- [j18]Fedor M. Fominykh, Pavel V. Martyugin, Mikhail V. Volkov:
P(L)Aying for Synchronization. Int. J. Found. Comput. Sci. 24(6): 765-780 (2013) - [i4]Dimitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov:
Primitive digraphs with large exponents and slowly synchronizing automata. CoRR abs/1302.5793 (2013) - 2012
- [c11]Fedor M. Fominykh, Mikhail V. Volkov:
P(l)aying for Synchronization. CIAA 2012: 159-170 - [i3]Fedor M. Fominykh, Mikhail V. Volkov:
P(l)aying for Synchronization. CoRR abs/1205.2174 (2012) - 2011
- [j17]Edmond W. H. Lee, Mikhail V. Volkov:
Limit Varieties Generated by Completely 0-Simple Semigroups. Int. J. Algebra Comput. 21(1-2): 257-294 (2011) - 2010
- [j16]David Easdown, Mark V. Sapir, Mikhail V. Volkov:
Periodic Elements of the Free Idempotent Generated Semigroup on a Biordered Set. Int. J. Algebra Comput. 20(2): 189-194 (2010) - [c10]Marcel Jackson, Mikhail V. Volkov:
The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion. Fields of Logic and Computation 2010: 414-443 - [c9]Dimitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov:
Slowly Synchronizing Automata and Digraphs. MFCS 2010: 55-65 - [i2]Dimitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov:
Slowly synchronizing automata and digraphs. CoRR abs/1005.0129 (2010) - [i1]Mikhail V. Volkov, Svetlana V. Goldberg, Stanislav I. Kublanovsky:
A minimal nonfinitely based semigroup whose variety is polynomially recognizable. CoRR abs/1008.2425 (2010)
2000 – 2009
- 2009
- [j15]I. A. Mikhailova, Mikhail V. Volkov:
Pattern avoidance by palindromes. Theor. Comput. Sci. 410(30-32): 2992-2998 (2009) - [j14]Mikhail V. Volkov:
Synchronizing automata preserving a chain of partial orders. Theor. Comput. Sci. 410(37): 3513-3519 (2009) - 2008
- [c8]Mikhail V. Volkov:
Synchronizing Automata and the Cerny Conjecture. LATA 2008: 11-27 - 2007
- [j13]Dimitry S. Ananichev, Mikhail V. Volkov, Yu. I. Zaks:
Synchronizing automata with a letter of deficiency 2. Theor. Comput. Sci. 376(1-2): 30-41 (2007) - [c7]Mikhail V. Volkov:
Synchronizing Automata Preserving a Chain of Partial Orders. CIAA 2007: 27-37 - [e1]Volker Diekert, Mikhail V. Volkov, Andrei Voronkov:
Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings. Lecture Notes in Computer Science 4649, Springer 2007, ISBN 978-3-540-74509-9 [contents] - 2006
- [j12]Jorge Almeida, Mikhail V. Volkov:
Subword Complexity of Profinite Words and Subgroups of Free Profinite Semigroups. Int. J. Algebra Comput. 16(2): 221-258 (2006) - [j11]Dimitry S. Ananichev, Ilja V. Petrov, Mikhail V. Volkov:
Collapsing Words: a Progress Report. Int. J. Found. Comput. Sci. 17(3): 507-518 (2006) - [c6]Dimitry S. Ananichev, Mikhail V. Volkov, Yu. I. Zaks:
Synchronizing Automata with a Letter of Deficiency 2. Developments in Language Theory 2006: 433-442 - 2005
- [j10]Jorge Almeida, Stuart W. Margolis, Mikhail V. Volkov:
The pseudovariety of semigroups of triangular matrices over a finite field. RAIRO Theor. Informatics Appl. 39(1): 31-48 (2005) - [j9]Dimitry S. Ananichev, Mikhail V. Volkov:
Synchronizing generalized monotonic automata. Theor. Comput. Sci. 330(1): 3-13 (2005) - [c5]Dimitry S. Ananichev, Ilja V. Petrov, Mikhail V. Volkov:
Collapsing Words: A Progress Report. Developments in Language Theory 2005: 11-21 - 2004
- [j8]Mikhail V. Volkov:
Reflexive Relations, Extensive Transformations and Piecewise Testable Languages of a Given Height. Int. J. Algebra Comput. 14(5-6): 817-827 (2004) - [j7]Stuart W. Margolis, Jean-Eric Pin, Mikhail V. Volkov:
Words Guaranteeing Minimum Image. Int. J. Found. Comput. Sci. 15(2): 259-276 (2004) - [j6]Mikhail V. Volkov:
Checking quasi-identities in a finite semigroup may be computationally hard. Stud Logica 78(1-2): 349-356 (2004) - [j5]Dimitry S. Ananichev, Mikhail V. Volkov:
Synchronizing monotonic automata. Theor. Comput. Sci. 327(3): 225-239 (2004) - 2003
- [j4]Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov:
Image reducing words and subgroups of free groups. Theor. Comput. Sci. 307(1): 77-92 (2003) - [c4]Dimitry S. Ananichev, Mikhail V. Volkov:
Synchronizing Monotonic Automata. Developments in Language Theory 2003: 111-121 - 2002
- [c3]Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov:
An Inverse Automata Algorithm for Recognizing 2-Collapsing Words. Developments in Language Theory 2002: 270-282 - 2001
- [j3]Jorge Almeida, Peter M. Higgins, Mikhail V. Volkov:
The Gap Between Partial and Full: an Addendum. Int. J. Algebra Comput. 11(1): 131-135 (2001) - [c2]Dimitry S. Ananichev, Mikhail V. Volkov:
Collapsing Words vs. Synchronizing Words. Developments in Language Theory 2001: 166-174 - 2000
- [c1]Stuart W. Margolis, Jean-Eric Pin, Mikhail V. Volkov:
Words Guaranteeing Minimal Image. Words, Languages & Combinatorics 2000: 297-310
1990 – 1999
- 1998
- [j2]Jorge Almeida, Mikhail V. Volkov:
The Gap Between Partial and Full. Int. J. Algebra Comput. 8(3): 399-430 (1998) - 1995
- [j1]Mikhail V. Volkov:
On a Class of Semigroup Pseudovarieties without Finite Pseudoidentity Basis. Int. J. Algebra Comput. 5(2): 127-136 (1995)
Coauthor Index
aka: Dimitry S. Ananichev
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
