Standard

Generating square-free words efficiently. / Shur, Arseny M.
в: Theoretical Computer Science, Том 601, 01.01.2015, стр. 67-72.

Результаты исследований: Вклад в журнал › Статья › Рецензирование

Harvard

Shur, AM 2015, 'Generating square-free words efficiently', Theoretical Computer Science, Том. 601, стр. 67-72. https://doi.org/10.1016/j.tcs.2015.07.027

APA

Shur, A. M. (2015). Generating square-free words efficiently. Theoretical Computer Science, 601, 67-72. https://doi.org/10.1016/j.tcs.2015.07.027

Vancouver

Shur AM. Generating square-free words efficiently. Theoretical Computer Science. 2015 янв. 1;601:67-72. doi: 10.1016/j.tcs.2015.07.027

Author

Shur, Arseny M. / Generating square-free words efficiently. в: Theoretical Computer Science. 2015 ; Том 601. стр. 67-72.

BibTeX

@article{334a0fbfce8c4f949cf920829fe30ac5,
title = "Generating square-free words efficiently",
keywords = "Square-free word, Random word, String algorithms, POWER-FREE LANGUAGES, GROWTH",
author = "Shur, {Arseny M.}",
year = "2015",
month = jan,
day = "1",
doi = "10.1016/j.tcs.2015.07.027",
language = "English",
volume = "601",
pages = "67--72",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier BV",

}

RIS

TY - JOUR

T1 - Generating square-free words efficiently

AU - Shur, Arseny M.

PY - 2015/1/1

Y1 - 2015/1/1

KW - Square-free word

KW - Random word

KW - String algorithms

KW - POWER-FREE LANGUAGES

KW - GROWTH

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

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

U2 - 10.1016/j.tcs.2015.07.027

DO - 10.1016/j.tcs.2015.07.027

M3 - Article

AN - SCOPUS:84941735342

VL - 601

SP - 67

EP - 72

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -

ID: 288490