The edit distance between finite-valued transducers is computable.
Edit Distance of Finite State Transducers
2 Pith papers cite this work, alongside 1 external citations. Polarity classification is still indexing.
2
Pith papers citing it
1
external citations · OpenAlex
fields
cs.FL 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Edit Distance of Finite-Valued Transducers
The edit distance between finite-valued transducers is computable.
-
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.