1 problem

Let $\mathbf{mt}_{\mathrm{d}}(n,m)$ denote the maximum, over deterministic finite automata with $n$ states and an alphabet of size $m$, of the length of their shortest mortal word.…