Muestra métricas de impacto externas asociadas a la publicación. Para mayor detalle:
| Indexado |
|
||||
| DOI | 10.1016/J.TCS.2014.04.021 | ||||
| Año | 2014 | ||||
| Tipo | artículo de investigación |
Citas Totales
Autores Afiliación Chile
Instituciones Chile
% Participación
Internacional
Autores
Afiliación Extranjera
Instituciones
Extranjeras
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. In this case, we show that the optimal streaming editor can be produced in P. (C) 2014 Elsevier B.V. All rights reserved.
| Ord. | Autor | Género | Institución - País |
|---|---|---|---|
| 1 | Benedikt, Michael | Hombre |
UNIV OXFORD - Reino Unido
University of Oxford - Reino Unido |
| 2 | Puppis, Gabriele | Mujer |
Univ Bordeaux - Francia
Université de Bordeaux - Francia |
| 3 | Riveros, Cristian | Hombre |
Pontificia Universidad Católica de Chile - Chile
|
| Fuente |
|---|
| EPSRC |
| Engineering and Physical Sciences Research Council |
| Engineering and Physical Sciences Research Council UK |
| Agradecimiento |
|---|
| We thank Benjamin Aminoff and the anonymous reviewers of ICALP and TCS for their great help with earlier versions of this manuscript. Benedikt, Puppis, and Riveros are supported by EP/G004021/1, the Engineering and Physical Sciences Research Council UK. |
| We thank Benjamin Aminoff and the anonymous reviewers of ICALP and TCS for their great help with earlier versions of this manuscript. Benedikt, Puppis, and Riveros are supported by EP/G004021/1 , the Engineering and Physical Sciences Research Council UK. |