Languages with a finite antidictionary: Growth-preserving transformations and available orders of growth

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

Язык оригиналаАнглийский
Название основной публикацииDevelopments in Language Theory - 17th International Conference, DLT 2013, Proceedings
Страницы445-457
Число страниц13
Том7907 LNCS
DOI
СостояниеОпубликовано - 2013
Событие17th International Conference on Developments in Language Theory, DLT 2013 - Marne-la-Vallee, Франция
Продолжительность: 18 июн 201321 июн 2013

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

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

Конференция

Конференция17th International Conference on Developments in Language Theory, DLT 2013
СтранаФранция
ГородMarne-la-Vallee
Период18/06/201321/06/2013

Отпечаток

Order of Growth
Automata
Formal languages
Structural properties
Condensation
Regular Languages
Exponential Growth
Digraph
Structural Properties
Simplification
Nonexistence
Language
Finite Set
Isomorphic
Graph in graph theory

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

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

    • Computer Science(all)
    • Theoretical Computer Science

    Цитировать

    Shur, A. M. (2013). Languages with a finite antidictionary: Growth-preserving transformations and available orders of growth. В Developments in Language Theory - 17th International Conference, DLT 2013, Proceedings (Том 7907 LNCS, стр. 445-457). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 7907 LNCS). https://doi.org/10.1007/978-3-642-38771-5_39
    Shur, Arseny M. / Languages with a finite antidictionary: Growth-preserving transformations and available orders of growth. Developments in Language Theory - 17th International Conference, DLT 2013, Proceedings. Том 7907 LNCS 2013. стр. 445-457 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{866b8e9772f343ce9491bedb7202c9c6,
    title = "Languages with a finite antidictionary: Growth-preserving transformations and available orders of growth",
    keywords = "combinatorial complexity, finite antidictionary, growth rate, regular language",
    author = "Shur, {Arseny M.}",
    year = "2013",
    doi = "10.1007/978-3-642-38771-5_39",
    language = "English",
    isbn = "9783642387708",
    volume = "7907 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "445--457",
    booktitle = "Developments in Language Theory - 17th International Conference, DLT 2013, Proceedings",

    }

    Shur, AM 2013, Languages with a finite antidictionary: Growth-preserving transformations and available orders of growth. в Developments in Language Theory - 17th International Conference, DLT 2013, Proceedings. том. 7907 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), том. 7907 LNCS, стр. 445-457, 17th International Conference on Developments in Language Theory, DLT 2013, Marne-la-Vallee, Франция, 18/06/2013. https://doi.org/10.1007/978-3-642-38771-5_39

    Languages with a finite antidictionary: Growth-preserving transformations and available orders of growth. / Shur, Arseny M.

    Developments in Language Theory - 17th International Conference, DLT 2013, Proceedings. Том 7907 LNCS 2013. стр. 445-457 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 7907 LNCS).

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

    TY - GEN

    T1 - Languages with a finite antidictionary: Growth-preserving transformations and available orders of growth

    AU - Shur, Arseny M.

    PY - 2013

    Y1 - 2013

    KW - combinatorial complexity

    KW - finite antidictionary

    KW - growth rate

    KW - regular language

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

    U2 - 10.1007/978-3-642-38771-5_39

    DO - 10.1007/978-3-642-38771-5_39

    M3 - Conference contribution

    SN - 9783642387708

    VL - 7907 LNCS

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

    SP - 445

    EP - 457

    BT - Developments in Language Theory - 17th International Conference, DLT 2013, Proceedings

    ER -

    Shur AM. Languages with a finite antidictionary: Growth-preserving transformations and available orders of growth. В Developments in Language Theory - 17th International Conference, DLT 2013, Proceedings. Том 7907 LNCS. 2013. стр. 445-457. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-38771-5_39