Maslennikova, M. I.

Candidate of Sciences

  • Fonte: Scopus
  • Calculado com base no n.º de publicações armazenadas no Pure e citações do Scopus
20132019

Resultado de pesquisa por ano

Se fez quaisquer alterações no Pure, estas estarão visíveis aqui em breve.
Filtro
Conference contribution

Resultados da pesquisa

  • 2014

    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 pesquisa: Conference contributionrevisão de pares

    5 Citações (Scopus)
  • 2015

    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 pesquisa: Conference contributionrevisão de pares

    2 Citações (Scopus)
  • 2017

    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 pesquisa: Conference contributionrevisão de pares

    1 Citação (Scopus)