Tighter Bounds for Wheeler Determinization

Philip Bille, Inge Li Gørtz, Máximo Pérez-López +1

Given a Wheeler NFA $\mathcal{A}$, the Wheeler determinization problem is to construct a Wheeler DFA $\mathcal{D}$ that accepts the same language as $\mathcal{A}$. We use the notat…