On the tree of binary cube-free words

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

1 цитирование (Scopus)
Язык оригиналаАнглийский
Название основной публикацииDevelopments in Language Theory - 21st International Conference, DLT 2017, Proceedings
ИздательSpringer Verlag
Страницы296-307
Число страниц12
Том10396 LNCS
ISBN (печатное издание)9783319628080
DOI
СостояниеОпубликовано - 2017
Событие21st International Conference on Developments in Language Theory, DLT 2017 - Liege, Бельгия
Продолжительность: 7 авг 201711 авг 2017

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

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

Конференция

Конференция21st International Conference on Developments in Language Theory, DLT 2017
СтранаБельгия
ГородLiege
Период07/08/201711/08/2017

Отпечаток

Regular hexahedron
Binary
Path
Prefix
Branching
Vertex of a graph
Theorem

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

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

    • Theoretical Computer Science
    • Computer Science(all)

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

    • Компьютерные науки, Теория и методы

    Цитировать

    Petrova, E. A., & Shur, A. M. (2017). On the tree of binary cube-free words. В Developments in Language Theory - 21st International Conference, DLT 2017, Proceedings (Том 10396 LNCS, стр. 296-307). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10396 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-62809-7_22
    Petrova, Elena A. ; Shur, Arseny M. / On the tree of binary cube-free words. Developments in Language Theory - 21st International Conference, DLT 2017, Proceedings. Том 10396 LNCS Springer Verlag, 2017. стр. 296-307 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{103e61d39a71401989ba7e5f0820755b,
    title = "On the tree of binary cube-free words",
    keywords = "Cube-free word, Power-free word, Prefix tree",
    author = "Petrova, {Elena A.} and Shur, {Arseny M.}",
    year = "2017",
    doi = "10.1007/978-3-319-62809-7_22",
    language = "English",
    isbn = "9783319628080",
    volume = "10396 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "296--307",
    booktitle = "Developments in Language Theory - 21st International Conference, DLT 2017, Proceedings",
    address = "Germany",

    }

    Petrova, EA & Shur, AM 2017, On the tree of binary cube-free words. в Developments in Language Theory - 21st International Conference, DLT 2017, Proceedings. том. 10396 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), том. 10396 LNCS, Springer Verlag, стр. 296-307, 21st International Conference on Developments in Language Theory, DLT 2017, Liege, Бельгия, 07/08/2017. https://doi.org/10.1007/978-3-319-62809-7_22

    On the tree of binary cube-free words. / Petrova, Elena A.; Shur, Arseny M.

    Developments in Language Theory - 21st International Conference, DLT 2017, Proceedings. Том 10396 LNCS Springer Verlag, 2017. стр. 296-307 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10396 LNCS).

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

    TY - GEN

    T1 - On the tree of binary cube-free words

    AU - Petrova, Elena A.

    AU - Shur, Arseny M.

    PY - 2017

    Y1 - 2017

    KW - Cube-free word

    KW - Power-free word

    KW - Prefix tree

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

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

    U2 - 10.1007/978-3-319-62809-7_22

    DO - 10.1007/978-3-319-62809-7_22

    M3 - Conference contribution

    SN - 9783319628080

    VL - 10396 LNCS

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

    SP - 296

    EP - 307

    BT - Developments in Language Theory - 21st International Conference, DLT 2017, Proceedings

    PB - Springer Verlag

    ER -

    Petrova EA, Shur AM. On the tree of binary cube-free words. В Developments in Language Theory - 21st International Conference, DLT 2017, Proceedings. Том 10396 LNCS. Springer Verlag. 2017. стр. 296-307. (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-62809-7_22