Maslennikova, M. I.

Candidate of Sciences

  • 来源:Scopus
  • 根据储存在 Pure 的刊物以及来自 Scopus 的引用文献数量计算
20132019

每年的科研成果

如果您在 Pure 中进行了任何更改,将很快在这里可见。
过滤
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. (编辑). Springer Verlag, 卷 8614 LNCS. 页码 306-317 12 页码 (Lecture Notes in Computer Science; 卷 8614).

    科研成果: Conference contribution同行评审

    5 引用 (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, 卷 9139. 页码 325-338 14 页码 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 9139).

    科研成果: Conference contribution同行评审

    2 引用 (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, 卷 10316 LNCS. 页码 262-273 12 页码 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 10316 LNCS).

    科研成果: Conference contribution同行评审

    1 引用 (Scopus)