Standard

Combinatorial complexity of regular languages. / Shur, Arseny M.
Computer Science - Theory and Applications - Third International Computer Science Symposium in Russia, CSR 2008, Proceedings. 2008. стр. 289-301 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 5010 LNCS).

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

Harvard

Shur, AM 2008, Combinatorial complexity of regular languages. в Computer Science - Theory and Applications - Third International Computer Science Symposium in Russia, CSR 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 5010 LNCS, стр. 289-301. https://doi.org/10.1007/978-3-540-79709-8_30

APA

Shur, A. M. (2008). Combinatorial complexity of regular languages. в Computer Science - Theory and Applications - Third International Computer Science Symposium in Russia, CSR 2008, Proceedings (стр. 289-301). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 5010 LNCS). https://doi.org/10.1007/978-3-540-79709-8_30

Vancouver

Shur AM. Combinatorial complexity of regular languages. в Computer Science - Theory and Applications - Third International Computer Science Symposium in Russia, CSR 2008, Proceedings. 2008. стр. 289-301. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-79709-8_30

Author

Shur, Arseny M. / Combinatorial complexity of regular languages. Computer Science - Theory and Applications - Third International Computer Science Symposium in Russia, CSR 2008, Proceedings. 2008. стр. 289-301 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{940f92ced4854e3c9487b30c4fd7bfbe,
title = "Combinatorial complexity of regular languages",
author = "Shur, {Arseny M.}",
year = "2008",
doi = "10.1007/978-3-540-79709-8_30",
language = "English",
isbn = "3540797084",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "289--301",
booktitle = "Computer Science - Theory and Applications - Third International Computer Science Symposium in Russia, CSR 2008, Proceedings",

}

RIS

TY - GEN

T1 - Combinatorial complexity of regular languages

AU - Shur, Arseny M.

PY - 2008

Y1 - 2008

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

U2 - 10.1007/978-3-540-79709-8_30

DO - 10.1007/978-3-540-79709-8_30

M3 - Conference contribution

AN - SCOPUS:44649165793

SN - 3540797084

SN - 9783540797081

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

SP - 289

EP - 301

BT - Computer Science - Theory and Applications - Third International Computer Science Symposium in Russia, CSR 2008, Proceedings

ER -

ID: 30134853