Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Metadata 
bibkey: turek2013abelian
authors: Ondřej Turek
year: 2013
title: Abelian complexity and Abelian co-decomposition
doi: 10.1016/j.tcs.2012.10.034
url: https://arxiv.org/abs/1201.2109v1
claim: Observation 4.1 and Propositions 4.4 and 4.8 give factor-containing prefixes for Parry words; for the m-bonacci substitution with m at least two, R=m and every length-n factor with n at most U_m(k) occurs in P_(k+m) followed by the length-n prefix.
strata_touched:
  - D5/S1/Words/MBonacciFactorWindow.factor_window
license: citation-only
triage: anchor

Factor-containing prefixes

The article appears in Theoretical Computer Science 469 (2013), 77–91. Observation 4.1 and Propositions 4.4 and 4.8 supply the factor-prefix construction; all substitution exponents are one in the m-bonacci specialization.

Locator

DOI: https://doi.org/10.1016/j.tcs.2012.10.034

URL: https://arxiv.org/abs/1201.2109v1