Computing the edit distance of a regular language

Information and Computation

Volumn 205, Issue 9, 2007, Pages 1307-1316

  Konstantinidis, Stavros ^a  

^a SAINT MARY S UNIVERSITY   (Canada)

Author keywords

Algorithm; Constraint system; Edit distance; Finite automaton; Levenshtein distance; Regular language

Indexed keywords

ALGORITHMS; FINITE AUTOMATA; POLYNOMIAL APPROXIMATION;

CONSTRAINT SYSTEMS; EDIT DISTANCE; LEVENSHTEIN DISTANCE; NUMBER OF STATE; POLYNOMIAL TIME COMPLEXITY; UPPER BOUND;

FORMAL LANGUAGES;

EID: 84855195769     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.06.001     Document Type: Article

References (17)

1. A. Amir, M. Lewenstein, N. Lewenstein, Pattern matching in hypertext, Journal of Algorithms 35(2000) 82-99.
2. L. Kari, S. Konstantinidis, Descriptional complexity of error/edit systems, J. Automata, Languages and Combinatorics 9(2004) 293-309.
3. L. Kari, S. Konstantinidis, S. Perron, G. Wozniak, J. Xu, Finite-state error/edit-systems and difference-measures for languages and words, Technical Report 2003-01, Dept. Math. and Computing Sci., Saint Mary's University, Canada, 2003, pp. 10, Available electronically at .
4. L. Kari, S. Konstantinidis, S. Perron, G. Wozniak, J. Xu, Computing the Hamming distance of a regular language in quadratic time, WSEAS Transactions on Information Science and Applications 1(2004) 445-449.
5. S. Konstantinidis, Computing the Levenshtein distance of a regular language, in: Proceedings (electronic) of 2005 IEEE Information Theory Workshop on Coding and Complexity, 29th August-1st September, 2005, Rotorua, New Zealand, pp. 113-116. (Pubitemid 44461704)
6. V. I. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals, Soviet Physics Dokl. 10(1966) 707-710.
7. B. H. Marcus, R. M. Roth, P. H. Siegel, Constrained systems and coding for recording channels, in: [11], pp. 1635-1764.
8. M. Mohri, Edit-distance of weighted automata: general definitions and algorithms, International Journal of Foundations of Computer Science 14(6) (2003) 957-982.
9. E. W. Myers, W. Miller, Approximate matching of regular expressions, Bulletin of Mathematical Biology 51(1) (1989) 5-37. (Pubitemid 19036570)
10. G. Pighizzini, How hard is computing the edit distance?, Information and Computation 165(2001) 1-13.
11. V. S. Pless, W. C. Huffman (Eds.), Handbook of Coding Theory, Elsevier, Amsterdam, 1998.
12. S. Roman, Coding and Information Theory, Springer-Verlag, New York, 1992.
13. G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. I, Springer, Berlin, 1997.
14. D. Sankoff, J. Kruskal, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, CSLI Publications, 1999.
15. A. Vardy, Trellis structure of codes, in: [11], pp. 1989-2117.
16. R. A. Wagner, Order-n correction for regular languages, Communications of the ACM 17(5) (1974) 265-268.
17. S. Yu, Regular languages, in: [13], pp. 41-110.