Constructing premaximal ternary square-free words of any level

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

6 Цитирования (Scopus)
Язык оригиналаАнглийский
Название основной публикацииMathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Proceedings
Страницы752-763
Число страниц12
Том7464 LNCS
DOI
СостояниеОпубликовано - 2012
Событие37th International Symposium on Mathematical Foundations of Computer Science 2012, MFCS 2012 - Bratislava, Словакия
Продолжительность: 27 авг 201231 авг 2012

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

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

Конференция

Конференция37th International Symposium on Mathematical Foundations of Computer Science 2012, MFCS 2012
СтранаСловакия
ГородBratislava
Период27/08/201231/08/2012

Отпечаток

Square free
Ternary
Extendability
Open Problems
Resolve
Integer

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

  • Computer Science(all)
  • Theoretical Computer Science

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

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

Цитировать

Petrova, E. A., & Shur, A. M. (2012). Constructing premaximal ternary square-free words of any level. В Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Proceedings (Том 7464 LNCS, стр. 752-763). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 7464 LNCS). https://doi.org/10.1007/978-3-642-32589-2_65
Petrova, Elena A. ; Shur, Arseny M. / Constructing premaximal ternary square-free words of any level. Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Proceedings. Том 7464 LNCS 2012. стр. 752-763 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{3c247df1de2848de88ac2b8e5adaba66,
title = "Constructing premaximal ternary square-free words of any level",
author = "Petrova, {Elena A.} and Shur, {Arseny M.}",
year = "2012",
doi = "10.1007/978-3-642-32589-2_65",
language = "English",
isbn = "9783642325885",
volume = "7464 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "752--763",
booktitle = "Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Proceedings",

}

Petrova, EA & Shur, AM 2012, Constructing premaximal ternary square-free words of any level. в Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Proceedings. том. 7464 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), том. 7464 LNCS, стр. 752-763, 37th International Symposium on Mathematical Foundations of Computer Science 2012, MFCS 2012, Bratislava, Словакия, 27/08/2012. https://doi.org/10.1007/978-3-642-32589-2_65

Constructing premaximal ternary square-free words of any level. / Petrova, Elena A.; Shur, Arseny M.

Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Proceedings. Том 7464 LNCS 2012. стр. 752-763 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 7464 LNCS).

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

TY - GEN

T1 - Constructing premaximal ternary square-free words of any level

AU - Petrova, Elena A.

AU - Shur, Arseny M.

PY - 2012

Y1 - 2012

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

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

U2 - 10.1007/978-3-642-32589-2_65

DO - 10.1007/978-3-642-32589-2_65

M3 - Conference contribution

SN - 9783642325885

VL - 7464 LNCS

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

SP - 752

EP - 763

BT - Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Proceedings

ER -

Petrova EA, Shur AM. Constructing premaximal ternary square-free words of any level. В Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Proceedings. Том 7464 LNCS. 2012. стр. 752-763. (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-32589-2_65