Reset complexity of ideal languages over a binary alphabet

Результат исследований: Глава в книге, отчете, сборнике статейМатериалы конференцииНаучно-исследовательскаярецензирование

1 цитирование (Scopus)
Язык оригиналаАнглийский
Название основной публикацииDescriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings
ИздательSpringer Verlag
Страницы262-273
Число страниц12
Том10316 LNCS
ISBN (печатное издание)9783319602516
DOI
СостояниеОпубликовано - 2017
Событие19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017 - Milano, Италия
Продолжительность: 3 июл 20175 июл 2017

Серия публикаций

НазваниеLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Том10316 LNCS
ISSN (печатное издание)03029743
ISSN (электронное издание)16113349

Конференция

Конференция19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017
СтранаИталия
ГородMilano
Период03/07/201705/07/2017

Отпечаток

Binary
Automata
Completeness
Language

Ключевые слова

    Предметные области ASJC Scopus

    • Theoretical Computer Science
    • Computer Science(all)

    Предметные области WoS

    • Компьютерные науки, Программное обеспечение
    • Компьютерные науки, Теория и методы
    • Логика

    Цитировать

    Maslennikova, M. (2017). Reset complexity of ideal languages over a binary alphabet. В Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings (Том 10316 LNCS, стр. 262-273). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10316 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-60252-3_21
    Maslennikova, Marina. / Reset complexity of ideal languages over a binary alphabet. Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings. Том 10316 LNCS Springer Verlag, 2017. стр. 262-273 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{83975bd9d48a4f699881f144ddec6299,
    title = "Reset complexity of ideal languages over a binary alphabet",
    keywords = "Ideal language, PSPACE-completeness, Reset complexity, Reset word, Synchronizing automaton",
    author = "Marina Maslennikova",
    year = "2017",
    doi = "10.1007/978-3-319-60252-3_21",
    language = "English",
    isbn = "9783319602516",
    volume = "10316 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "262--273",
    booktitle = "Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings",
    address = "Germany",

    }

    Maslennikova, M 2017, Reset complexity of ideal languages over a binary alphabet. в Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings. том. 10316 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), том. 10316 LNCS, Springer Verlag, стр. 262-273, 19th International Conference of Descriptional Complexity of Formal Systems, DCFS 2017, Milano, Италия, 03/07/2017. https://doi.org/10.1007/978-3-319-60252-3_21

    Reset complexity of ideal languages over a binary alphabet. / Maslennikova, Marina.

    Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings. Том 10316 LNCS Springer Verlag, 2017. стр. 262-273 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10316 LNCS).

    Результат исследований: Глава в книге, отчете, сборнике статейМатериалы конференцииНаучно-исследовательскаярецензирование

    TY - GEN

    T1 - Reset complexity of ideal languages over a binary alphabet

    AU - Maslennikova, Marina

    PY - 2017

    Y1 - 2017

    KW - Ideal language

    KW - PSPACE-completeness

    KW - Reset complexity

    KW - Reset word

    KW - Synchronizing automaton

    UR - http://www.scopus.com/inward/record.url?scp=85022324516&partnerID=8YFLogxK

    UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000440468100021

    U2 - 10.1007/978-3-319-60252-3_21

    DO - 10.1007/978-3-319-60252-3_21

    M3 - Conference contribution

    SN - 9783319602516

    VL - 10316 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 262

    EP - 273

    BT - Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings

    PB - Springer Verlag

    ER -

    Maslennikova M. Reset complexity of ideal languages over a binary alphabet. В Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Proceedings. Том 10316 LNCS. Springer Verlag. 2017. стр. 262-273. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-60252-3_21