11 - 20 out of 106Page size: 10
Sort by: Title

  1. Careful synchronization of partial deterministic finite automata

    Shabana, H. & Volkov, M. V., Aug 2022, In: Acta Informatica. 59, 4, p. 479-504 26 p.

    Research output: Contribution to journal › Article › peer-review

  2. Catalan monoids inherently nonfinitely based relative to finite -trivial semigroups

    Sapir, O. B. & Volkov, M. V., 1 Nov 2023, In: Journal of Algebra. 633, p. 138-171 34 p.

    Research output: Contribution to journal › Article › peer-review

  3. Characterization of group radicals with an application to mal’cev products

    Almeida, J., Margolis, S., Steinberg, B. & Volkov, M., 1 Jan 2010, In: Illinois Journal of Mathematics. 54, 1, p. 199-221 23 p.

    Research output: Contribution to journal › Article › peer-review

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

    Volkov, M. V., 1 Jan 2004, In: Studia Logica. 78, 1-2, p. 349-356 8 p.

    Research output: Contribution to journal › Article › peer-review

  5. Collapsing words: A progress report

    Ananichev, D. S., Petrov, I. V. & Volkov, M. V., 1 Jun 2006, In: International Journal of Foundations of Computer Science. 17, 3, p. 507-518 12 p.

    Research output: Contribution to journal › Article › peer-review

  6. Collapsing words: A progress report

    Ananichev, D. S., Petrov, I. V. & Volkov, M. V., 17 Oct 2005, In: Lecture Notes in Computer Science. 3572, p. 11-21 11 p.

    Research output: Contribution to journal › Conference article › peer-review

  7. Collapsingwords vs. synchronizingwords

    Ananichev, D. S. & Volkov, M. V., 1 Dec 2002, Developments in Language Theory - 5th International Conference, DLT 2001, Revised Papers. p. 166-174 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2295 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  8. Completely reachable automata

    Bondar, E. A. & Volkov, M. V., 2016, Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Proceedings. Springer Verlag, Vol. 9777. p. 1-17 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9777).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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

    Bondar, E., Casas, D. & Volkov, M., 2023, In: International Journal of Foundations of Computer Science. 34, 06, p. 655-690 36 p.

    Research output: Contribution to journal › Article › peer-review

  10. Complexity of the identity checking problem for finite semigroups

    Almeida, J., Volkov, M. V. & Goldberg, S. V., 1 May 2009, In: Journal of Mathematical Sciences. 158, 5, p. 605-614 10 p.

    Research output: Contribution to journal › Article › peer-review

Previous 1 2 3 4 5 6 7 8 ...11 Next

ID: 58226