◍wovepaper
SearchResearchersInstitutions
Sign in
institution

Turku Centre for Computer Science

Finland

1 paper here3 citations across 1
fields
  • math.CO1
ROR 00vy7ed73OpenAlex

affiliations via OpenAlex

most citedPolynomial versus Exponential Growth in Repetition-Free Binary Words

3 citations

researchers with a paper here
  • J. Karhumäki1
  • J. Shallit1
collaborating institutions
  • University of TurkuFI1 paper
  • University of WaterlooCA1 paper
Showing math.COShow all

1 paper · 1 filter

math.CO2003★ 3 cited

Polynomial versus Exponential Growth in Repetition-Free Binary Words

Juhani Karhumaki, Jeffrey Shallit

It is known that the number of overlap-free binary words of length n grows polynomially, while the number of cubefree binary words grows exponentially. We show that the dividing li…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.