Bounded comparison of transducers under Hamming distance is NL-complete for fixed k, co-NP-complete for binary k, DP-complete for exact distance k, with a tight quadratic bound on the maximum distance and logspace equivalence to the deviations problem.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hamming distance between finite transducers
Bounded comparison of transducers under Hamming distance is NL-complete for fixed k, co-NP-complete for binary k, DP-complete for exact distance k, with a tight quadratic bound on the maximum distance and logspace equivalence to the deviations problem.