A Characterization of Completely Reachable Automata

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

Язык оригиналаАнглийский
Название основной публикацииDevelopments in Language Theory - 22nd International Conference, DLT 2018, Proceedings
ИздательSpringer Verlag
Страницы145-155
Число страниц11
ISBN (печатное издание)9783319986531
DOI
СостояниеОпубликовано - 1 янв 2018
Событие22nd International Conference on Developments in Language Theory, DLT 2018 - Tokyo, Япония
Продолжительность: 9 сен 201813 сен 2018

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

НазваниеLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Том11088 LNCS
ISSN (печатное издание)0302-9743
ISSN (электронное издание)1611-3349

Конференция

Конференция22nd International Conference on Developments in Language Theory, DLT 2018
СтранаЯпония
ГородTokyo
Период09/09/201813/09/2018

Отпечаток

Directed graphs
Finite automata
Automata
Deterministic Finite Automata
Directed Graph
Subset

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

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

    • Theoretical Computer Science
    • Computer Science(all)

    Цитировать

    Bondar, E. A., & Volkov, M. V. (2018). A Characterization of Completely Reachable Automata. В Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings (стр. 145-155). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11088 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-98654-8_12
    Bondar, E. A. ; Volkov, M. V. / A Characterization of Completely Reachable Automata. Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Springer Verlag, 2018. стр. 145-155 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{3fc8653e959246269bc35f3e03dd3578,
    title = "A Characterization of Completely Reachable Automata",
    keywords = "Complete reachability, Deterministic finite automaton",
    author = "Bondar, {E. A.} and Volkov, {M. V.}",
    year = "2018",
    month = "1",
    day = "1",
    doi = "10.1007/978-3-319-98654-8_12",
    language = "English",
    isbn = "9783319986531",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "145--155",
    booktitle = "Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings",
    address = "Germany",

    }

    Bondar, EA & Volkov, MV 2018, A Characterization of Completely Reachable Automata. в Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), том. 11088 LNCS, Springer Verlag, стр. 145-155, 22nd International Conference on Developments in Language Theory, DLT 2018, Tokyo, Япония, 09/09/2018. https://doi.org/10.1007/978-3-319-98654-8_12

    A Characterization of Completely Reachable Automata. / Bondar, E. A.; Volkov, M. V.

    Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Springer Verlag, 2018. стр. 145-155 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11088 LNCS).

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

    TY - GEN

    T1 - A Characterization of Completely Reachable Automata

    AU - Bondar, E. A.

    AU - Volkov, M. V.

    PY - 2018/1/1

    Y1 - 2018/1/1

    KW - Complete reachability

    KW - Deterministic finite automaton

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

    U2 - 10.1007/978-3-319-98654-8_12

    DO - 10.1007/978-3-319-98654-8_12

    M3 - Conference contribution

    SN - 9783319986531

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

    SP - 145

    EP - 155

    BT - Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings

    PB - Springer Verlag

    ER -

    Bondar EA, Volkov MV. A Characterization of Completely Reachable Automata. В Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Springer Verlag. 2018. стр. 145-155. (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-98654-8_12