Maslennikova, M. I.

Candidate of Sciences

  • Source: Scopus
  • Calculated based on no. of publications stored in Pure and citations from Scopus
20132019

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 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).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Citation (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).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Citations (Scopus)
  • 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).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    5 Citations (Scopus)