Standard

Growth of Power-Free Languages over Large Alphabets. / Shur, Arseny M.
In: Theory of Computing Systems, Vol. 54, No. 2, 02.2014, p. 224-243.

Research output: Contribution to journal › Article › peer-review

Harvard

Shur, AM 2014, 'Growth of Power-Free Languages over Large Alphabets', Theory of Computing Systems, vol. 54, no. 2, pp. 224-243. https://doi.org/10.1007/s00224-013-9512-x

APA

Shur, A. M. (2014). Growth of Power-Free Languages over Large Alphabets. Theory of Computing Systems, 54(2), 224-243. https://doi.org/10.1007/s00224-013-9512-x

Vancouver

Shur AM. Growth of Power-Free Languages over Large Alphabets. Theory of Computing Systems. 2014 Feb;54(2):224-243. doi: 10.1007/s00224-013-9512-x

Author

Shur, Arseny M. / Growth of Power-Free Languages over Large Alphabets. In: Theory of Computing Systems. 2014 ; Vol. 54, No. 2. pp. 224-243.

BibTeX

@article{a3418b8b53e64e25a35ebd1e32333309,
title = "Growth of Power-Free Languages over Large Alphabets",
keywords = "Formal languages, Power-free languages, Finite automata, Growth rate, DEJEANS CONJECTURE, COMPLEXITY, WORDS, RATES",
author = "Shur, {Arseny M.}",
year = "2014",
month = feb,
doi = "10.1007/s00224-013-9512-x",
language = "English",
volume = "54",
pages = "224--243",
journal = "Theory of Computing Systems",
issn = "1432-4350",
publisher = "Springer",
number = "2",

}

RIS

TY - JOUR

T1 - Growth of Power-Free Languages over Large Alphabets

AU - Shur, Arseny M.

PY - 2014/2

Y1 - 2014/2

KW - Formal languages

KW - Power-free languages

KW - Finite automata

KW - Growth rate

KW - DEJEANS CONJECTURE

KW - COMPLEXITY

KW - WORDS

KW - RATES

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

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

U2 - 10.1007/s00224-013-9512-x

DO - 10.1007/s00224-013-9512-x

M3 - Article

AN - SCOPUS:84895063934

VL - 54

SP - 224

EP - 243

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 2

ER -

ID: 335938