The minimum Wheeler DFA for a Wheeler language can be computed from its minimum DFA in O(m_w log m_w) output-sensitive time, matching acyclic-only speeds while handling general topologies.
Wheeler graphs:
2 Pith papers cite this work, alongside 87 external citations. Polarity classification is still indexing.
2
Pith papers citing it
87
external citations · OpenAlex
years
2026 2representative citing papers
The proposed syntactic congruence for Wheeler transducers is not an equivalence relation, invalidating the stated Myhill–Nerode theorem.
citing papers explorer
-
On Computing Minimum Wheeler DFA From Their Language
The minimum Wheeler DFA for a Wheeler language can be computed from its minimum DFA in O(m_w log m_w) output-sensitive time, matching acyclic-only speeds while handling general topologies.
-
Finite-State Transducers in the Wheeler Setting
The proposed syntactic congruence for Wheeler transducers is not an equivalence relation, invalidating the stated Myhill–Nerode theorem.