@inproceedings{10902,
  abstract     = {We consider how to edit strings from a source language so that the edited strings belong to a target language, where the languages are given as deterministic finite automata. Non-streaming (or offline) transducers perform edits given the whole source string. We show that the class of deterministic one-pass transducers with registers along with increment and min operation suffices for computing optimal edit distance, whereas the same class of transducers without the min operation is not sufficient. Streaming (or online) transducers perform edits as the letters of the source string are received. We present a polynomial time algorithm for the partial-repair problem that given a bound α asks for the construction of a deterministic streaming transducer (if one exists) that ensures that the ‘maximum fraction’ η of the strings of the source language are edited, within cost α, to the target language.},
  author       = {Chatterjee, Krishnendu and Chaubal, Siddhesh and Rubin, Sasha},
  booktitle    = {7th International Conference on Language and Automata Theory and Applications},
  isbn         = {9783642370632},
  issn         = {1611-3349},
  location     = {Bilbao, Spain},
  pages        = {214--225},
  publisher    = {Springer Nature},
  title        = {{How to travel between languages}},
  doi          = {10.1007/978-3-642-37064-9_20},
  volume       = {7810},
  year         = {2013},
}