The complexity of mean payoff games on graphs
Theoretical Computer Science
The String-to-String Correction Problem
Journal of the ACM (JACM)
Order-n correction for regular languages
Communications of the ACM
Recognizable Sets with Multiplicities in the Tropical Semiring
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A new polynomial-time algorithm for linear programming
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Finite-state transducers in language and speech processing
Computational Linguistics
Understanding and Using Linear Programming (Universitext)
Understanding and Using Linear Programming (Universitext)
Computing the edit distance of a regular language
Information and Computation
Regular Repair of Specifications
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Bounded repairability for regular tree languages
Proceedings of the 15th International Conference on Database Theory
Which DTDs are streaming bounded repairable?
Proceedings of the 16th International Conference on Database Theory
A note on the approximation of mean-payoff games
Information Processing Letters
| Hi-index | 0.00 |
We show how to calculate the maximum number of edits per character needed to convert any string in one regular language to a string in another language. Our algorithm makes use of a local determinization procedure applicable to a subclass of distance automata. We then show how to calculate the same property when the editing needs to be done in streaming fashion, by a finite state transducer, using a reduction to mean-payoff games. We show that the optimal streaming editor can be produced in PTIME.