Standard

Growth rates of complexity of power-free languages. / Shur, Arseny M.
в: Theoretical Computer Science, Том 411, № 34-36, 17.07.2010, стр. 3209-3223.

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

Harvard

Shur, AM 2010, 'Growth rates of complexity of power-free languages', Theoretical Computer Science, Том. 411, № 34-36, стр. 3209-3223. https://doi.org/10.1016/j.tcs.2010.05.017

APA

Vancouver

Shur AM. Growth rates of complexity of power-free languages. Theoretical Computer Science. 2010 июль 17;411(34-36):3209-3223. doi: 10.1016/j.tcs.2010.05.017

Author

Shur, Arseny M. / Growth rates of complexity of power-free languages. в: Theoretical Computer Science. 2010 ; Том 411, № 34-36. стр. 3209-3223.

BibTeX

@article{f5262a50e1244b30bbe68da5c2153c6e,
title = "Growth rates of complexity of power-free languages",
keywords = "Finite antidictionary, Growth rate, Power-free language, Regular language",
author = "Shur, {Arseny M.}",
year = "2010",
month = jul,
day = "17",
doi = "10.1016/j.tcs.2010.05.017",
language = "English",
volume = "411",
pages = "3209--3223",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier BV",
number = "34-36",

}

RIS

TY - JOUR

T1 - Growth rates of complexity of power-free languages

AU - Shur, Arseny M.

PY - 2010/7/17

Y1 - 2010/7/17

KW - Finite antidictionary

KW - Growth rate

KW - Power-free language

KW - Regular language

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

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

U2 - 10.1016/j.tcs.2010.05.017

DO - 10.1016/j.tcs.2010.05.017

M3 - Article

AN - SCOPUS:77955413698

VL - 411

SP - 3209

EP - 3223

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 34-36

ER -

ID: 30082421