Growth rates of complexity of power-free languages › Research Explorer

Growth rates of complexity of power-free languages

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

DOI

https://doi.org/10.1016/j.tcs.2010.05.017
Final published version

Arseny M. Shur

Original language	English
Pages (from-to)	3209-3223
Number of pages	15
Journal	Theoretical Computer Science
Volume	411
Issue number	34-36
DOIs	https://doi.org/10.1016/j.tcs.2010.05.017
Publication status	Published - 17 Jul 2010

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Research areas

Finite antidictionary, Growth rate, Power-free language, Regular language

WoS ResearchAreas Categories

Computer Science, Theory & Methods

ID: 30082421