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

Personal profile

Education/Academic qualification

Mathematics and Physics, Candidate, Ministry of Science and Higher Education of the Russian Federation

10 Feb 2016 → …

Fingerprint Dive into the research topics where Марина Игоревна Масленникова is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 1 Similar Profiles
Automata Mathematics
Regular Languages Mathematics
Finitely Generated Mathematics
Language Mathematics
Binary Mathematics
De Bruijn Graph Mathematics
Deterministic Finite Automata Mathematics
Quotient Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2013 2019

  • 17 Citations
  • 3 h-Index
  • 4 Article
  • 3 Conference contribution

Reset Complexity of Ideal Languages Over a Binary Alphabet

Maslennikova, M., 2019, In : International Journal of Foundations of Computer Science. 30, 6-7, p. 1177-1196 20 p.

Research output: Contribution to journalArticleResearchpeer-review

Trim strongly connected synchronizing automata and ideal languages

Maslennikova, M. & Rodaro, E., 1 Jan 2018, In : Fundamenta Informaticae. 162, 2-3, p. 183-203 21 p.

Research output: Contribution to journalArticleResearchpeer-review

Automata
Quotient
Finitely Generated
Language
Series
1 Citation (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).

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

Binary
Automata
Completeness
Language
2 Citations (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 contributionResearchpeer-review

Formal languages
Regular Languages
Finite automata
Automata
Quotient
4 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 contributionResearchpeer-review

Automata
Deterministic Finite Automata
Language