Representation of (Left) ideal regular languages by synchronizing automata

Marina Maslennikova, Emanuele Rodaro

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

2 Цитирования (Scopus)
Язык оригиналаАнглийский
Название основной публикацииLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ИздательSpringer Verlag
Страницы325-338
Число страниц14
Том9139
ISBN (печатное издание)9783319202969
DOI
СостояниеОпубликовано - 2015
Событие10th International Computer Science Symposium in Russia, CSR 2015 - Listvyanka, Российская Федерация
Продолжительность: 13 июл 201517 июл 2015

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

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

Конференция

Конференция10th International Computer Science Symposium in Russia, CSR 2015
СтранаРоссийская Федерация
ГородListvyanka
Период13/07/201517/07/2015

Отпечаток

Formal languages
Regular Languages
Finite automata
Automata
Quotient
Deterministic Finite Automata
Homomorphic
Language
Lower bound
Series

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

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

    • Computer Science(all)
    • Theoretical Computer Science

    Цитировать

    Maslennikova, M., & Rodaro, E. (2015). Representation of (Left) ideal regular languages by synchronizing automata. В Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Том 9139, стр. 325-338). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 9139). Springer Verlag. https://doi.org/10.1007/978-3-319-20297-6_21
    Maslennikova, Marina ; Rodaro, Emanuele. / Representation of (Left) ideal regular languages by synchronizing automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Том 9139 Springer Verlag, 2015. стр. 325-338 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{b1916737bcc34a8fa453039e27313b82,
    title = "Representation of (Left) ideal regular languages by synchronizing automata",
    keywords = "Ideal language, Reset complexity, Reset left regular decomposition, Reset word, Strongly connected automaton, Synchronizing automaton",
    author = "Marina Maslennikova and Emanuele Rodaro",
    year = "2015",
    doi = "10.1007/978-3-319-20297-6_21",
    language = "English",
    isbn = "9783319202969",
    volume = "9139",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "325--338",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    address = "Germany",

    }

    Maslennikova, M & Rodaro, E 2015, Representation of (Left) ideal regular languages by synchronizing automata. в Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). том. 9139, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), том. 9139, Springer Verlag, стр. 325-338, 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Российская Федерация, 13/07/2015. https://doi.org/10.1007/978-3-319-20297-6_21

    Representation of (Left) ideal regular languages by synchronizing automata. / Maslennikova, Marina; Rodaro, Emanuele.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Том 9139 Springer Verlag, 2015. стр. 325-338 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 9139).

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

    TY - GEN

    T1 - Representation of (Left) ideal regular languages by synchronizing automata

    AU - Maslennikova, Marina

    AU - Rodaro, Emanuele

    PY - 2015

    Y1 - 2015

    KW - Ideal language

    KW - Reset complexity

    KW - Reset left regular decomposition

    KW - Reset word

    KW - Strongly connected automaton

    KW - Synchronizing automaton

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

    U2 - 10.1007/978-3-319-20297-6_21

    DO - 10.1007/978-3-319-20297-6_21

    M3 - Conference contribution

    SN - 9783319202969

    VL - 9139

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

    SP - 325

    EP - 338

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

    PB - Springer Verlag

    ER -

    Maslennikova M, Rodaro E. Representation of (Left) ideal regular languages by synchronizing automata. В Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Том 9139. Springer Verlag. 2015. стр. 325-338. (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-20297-6_21