Search the dblp DataBase
Mikhail V. Volkov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov
An Inverse Automata Algorithm for Recognizing 2-Collapsing Words. [Citation Graph (0, 0)][DBLP]
Developments in Language Theory, 2002, pp:270-282 [Conf] - Dimitry S. Ananichev, Ilja V. Petrov, Mikhail V. Volkov
Collapsing Words: A Progress Report. [Citation Graph (0, 0)][DBLP]
Developments in Language Theory, 2005, pp:11-21 [Conf] - Dimitry S. Ananichev, Mikhail V. Volkov
Collapsing Words vs. Synchronizing Words. [Citation Graph (0, 0)][DBLP]
Developments in Language Theory, 2001, pp:166-174 [Conf] - Dimitry S. Ananichev, Mikhail V. Volkov
Synchronizing Monotonic Automata. [Citation Graph (0, 0)][DBLP]
Developments in Language Theory, 2003, pp:111-121 [Conf] - Dimitry S. Ananichev, Mikhail V. Volkov, Yu. I. Zaks
Synchronizing Automata with a Letter of Deficiency 2. [Citation Graph (0, 0)][DBLP]
Developments in Language Theory, 2006, pp:433-442 [Conf] - Jorge Almeida, Peter M. Higgins, Mikhail V. Volkov
The Gap Between Partial and Full: an Addendum. [Citation Graph (0, 0)][DBLP]
IJAC, 2001, v:11, n:1, pp:131-135 [Journal] - Jorge Almeida, Mikhail V. Volkov
Subword Complexity of Profinite Words and Subgroups of Free Profinite Semigroups. [Citation Graph (0, 0)][DBLP]
IJAC, 2006, v:16, n:2, pp:221-258 [Journal] - Mikhail V. Volkov
Reflexive Relations, Extensive Transformations and Piecewise Testable Languages of a Given Height. [Citation Graph (0, 0)][DBLP]
IJAC, 2004, v:14, n:5-6, pp:817-827 [Journal] - Dimitry S. Ananichev, Ilja V. Petrov, Mikhail V. Volkov
Collapsing Words: a Progress Report. [Citation Graph (0, 0)][DBLP]
Int. J. Found. Comput. Sci., 2006, v:17, n:3, pp:507-518 [Journal] - Stuart W. Margolis, Jean-Eric Pin, Mikhail V. Volkov
Words Guaranteeing Minimum Image. [Citation Graph (0, 0)][DBLP]
Int. J. Found. Comput. Sci., 2004, v:15, n:2, pp:259-276 [Journal] - Mikhail V. Volkov
Checking quasi-identities in a finite semigroup may be computationally hard. [Citation Graph (0, 0)][DBLP]
Studia Logica, 2004, v:78, n:1-2, pp:349-356 [Journal] - Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov
Image reducing words and subgroups of free groups. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2003, v:307, n:1, pp:77-92 [Journal] - Dimitry S. Ananichev, Mikhail V. Volkov
Synchronizing monotonic automata. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2004, v:327, n:3, pp:225-239 [Journal] - Dimitry S. Ananichev, Mikhail V. Volkov
Synchronizing generalized monotonic automata. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:330, n:1, pp:3-13 [Journal] - Dimitry S. Ananichev, Mikhail V. Volkov, Yu. I. Zaks
Synchronizing automata with a letter of deficiency 2. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2007, v:376, n:1-2, pp:30-41 [Journal] - Mikhail V. Volkov
Synchronizing Automata Preserving a Chain of Partial Orders. [Citation Graph (0, 0)][DBLP]
CIAA, 2007, pp:27-37 [Conf]
The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion. [Citation Graph (, )][DBLP]
Slowly Synchronizing Automata and Digraphs. [Citation Graph (, )][DBLP]
Synchronizing Automata and the Cerny Conjecture. [Citation Graph (, )][DBLP]
Slowly synchronizing automata and digraphs [Citation Graph (, )][DBLP]
A minimal nonfinitely based semigroup whose variety is polynomially recognizable [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002