Maslennikova, M. I.

Candidate of Sciences

  • Fuente: Scopus
  • Se calcula con base en el n.º de publicaciones almacenadas en Pure y citas de Scopus
20132019

Resultados de investigaciones por año

Si hizo algún cambio en Pure, pronto podrá verlo aquí.
Filtro
Conference contribution

Resultados de la búsqueda

  • Conference contribution

    Complexity of Checking Whether Two Automata Are Synchronized by the Same Language

    Maslennikova, M., 2014, DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014. Jurgensen, H., Karhumaki, J. & Okhotin, A. (eds.). Springer Verlag, Vol. 8614 LNCS. p. 306-317 12 p. (Lecture Notes in Computer Science; vol. 8614).

    Resultado de la investigación: Conference contributionrevisión exhaustiva

    5 Citas (Scopus)
  • Representation of (Left) ideal regular languages by synchronizing automata

    Maslennikova, M. & Rodaro, E., 2015, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, Vol. 9139. p. 325-338 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9139).

    Resultado de la investigación: Conference contributionrevisión exhaustiva

    2 Citas (Scopus)
  • Reset complexity of ideal languages over a binary alphabet

    Maslennikova, M., 2017, Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings. Springer Verlag, Vol. 10316 LNCS. p. 262-273 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10316 LNCS).

    Resultado de la investigación: Conference contributionrevisión exhaustiva

    1 Cita (Scopus)