Quasiperiods, subword complexity and the smallest Pisot number

DOI10.25596/JALC-2016-093MaRDI QIDQ3178875zbMATH OpenOpenAlexFDO

Authors Ronny Polley, Ludwig Staiger

Publication date 20 December 2016

Full work available at URL https://search.datacite.org/works/10.25596/JALC-2016-093

zbMATH Keywords

Hausdorff measuresubword complexityinfinite wordsmallest Pisot numberquasiperiodic word

Mathematics Subject Classification ID

Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Combinatorics on words (68R15)

Recommendations

• The Maximal Subword Complexity of Quasiperiodic Infinite Words
• Quasiperiods of infinite words
• Minimal critical exponent of quasiperiodic words
• On the minimal complexity of infinite words
• Determining sets of quasiperiods of infinite words

Cited in

(7)

• Minimal critical exponent of quasiperiodic words
• \(k\)-approximate quasiperiodicity under Hamming and edit distance
• Subquadratic SNARGs in the random oracle model
• Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
• Quasiperiods of infinite words
• Subword complexity and periodicity in two or more dimensions
• The Maximal Subword Complexity of Quasiperiodic Infinite Words

This page was built for publication: Quasiperiods, subword complexity and the smallest Pisot number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178875)