1 problem

0 votes0 replies0 views
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
Conjectureopencontinued-fractions factor-complexity s-adic-systemsarXiv posted 2 days ago

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