1 problem

0 votes0 replies1 view
Conjecture on the state complexity of Klopsch's series for $m=2^\mu+1$
State-complexity conjecture. For $m=2^\mu+1$ , a minimal $2$ -automaton computing Klopsch's series $\sigma_{\mathrm{K},m}$ has $3\cdot 2^{\mu}+2\mu-2$ states.
Conjectureopenautomata-theory nottingham-grouparXiv posted 2 days ago

Conjecture on the state complexity of Klopsch's series for m=2μ+1m=2^\mu+1m=2μ+1