The mixed-alphabet language conjecture for smooth words
Let \mathpzcA={a,b}\mathpzc{A}=\{a,b\}\mathpzcA={a,b} be a mixed binary alphabet, let C∞\mathcal{C}^\inftyC∞ be the set of infinite smooth words over \mathpzcA\mathpzc{A}\mathpzcA, let Cf∞\mathcal{C}_f^\inftyCf∞ be the set of fini…
MathDB