An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2

Abstract

Automata, Logic and Semantics

Keywords

• special factor
• factor complexity
• s-adic conjecture
• rauzy graph
• s-adic subshift
• [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]