arXiv:2611.11572 · v1

Closing the Complexity Gap for Wheeler Graph Recognition on $d$-NFAs

首次提交 2026-11-09 03:34

版本更新 2026-11-09 03:34

雷达观测 2026-11-10 13:19

摘要

Wheeler graph recognition asks whether a directed graph whose arcs are labeled by symbols from a totally ordered alphabet admits a Wheeler order, a total order on its vertices compatible with the labels of arcs and the order of their tails. A $d$-NFA is a nondeterministic finite automaton in which at most $d$ transitions with any given label leave each state. For Wheeler graph recognition on $d$-NFAs, Alanko et al. gave a polynomial-time algorithm for $d \leq 2$, whereas Gibney and Thankachan proved NP-completeness for every fixed $d \geq 5$. The computational complexity for $d = 3$ and $d = 4$ remained open. We resolve both open cases by extending the reduction of Gibney and Thankachan with a new encoding of clauses of Not-All-Equal 3-SAT. Specifically, we prove that recognition is NP-complete even for directed acyclic graphs over an ordered binary alphabet with a unique source reaching every vertex and total out-degree at most three at every vertex. Consequently, Wheeler graph recognition on $d$-NFAs is NP-complete for every fixed $d \geq 3$.