2 problems

The complexity bound conjecture for S(e,23,e)-adic languages
Complexity bound conjecture. The complexity function $p_\mathcal{L}$ for any $S(e,23,e)$ -adic language $\mathcal{L}$ satisfies
opencontinued-fractions factor-complexity s-adic-systems
0 responses
07
The $S$ -adic Pisot conjecture
Let $S$ be a finite or infinite set of unimodular substitutions over the finite alphabet $\mathcal{A}$ , and let $\boldsymbol{\sigma}\in S^\mathbb{N}$ be a primitive, algebraically…
openergodic-theory s-adic-systems symbolic-dynamics
0 responses
02

The complexity bound conjecture for S(e,23,e)-adic languages