Fewest repetitions versus maximal-exponent powers in infinite binary words
type: Item
instance of: scholarly article
title: Fewest repetitions versus maximal-exponent powers in infinite binary words
zbMATH Open document ID: 1227.68083
author: Golnaz Badkobeh
published in: Theoretical Computer Science
publication date: 2011-12-07T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 5986992
zbMATH Keywords: combinatorics on words
zbMATH Keywords: repetitions
zbMATH Keywords: repetitive threshold
zbMATH Keywords: word morphisms
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.08.011
OpenAlex ID: W1985979067
cites work: Fewest repetitions in infinite binary words
cites work: A proof of Dejean’s conjecture
cites work: Sur un théorème de Thue
cites work: How many squares must a binary sequence contain?
cites work: Q3396590
cites work: A generalization of repetition threshold
cites work: Polynomial versus exponential growth in repetition-free binary words
cites work: Q4341774
cites work: A generator of morphisms for infinite words
cites work: Avoiding large squares in infinite binary words
cites work: Last cases of Dejean's conjecture
cites work: SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
DOI: 10.1016/J.TCS.2011.08.011
description: scientific article; zbMATH DE number 5986992