Prefix Distance Between Regular Languages
The prefix distance between two words x and y is defined as the number of symbol occurrences in the words that do not belong to the longest common prefix of x and y. We show how to model the prefix distance using weighted transducers. We use the weighted transducers to compute the prefix distance between two regular languages by a transducer-based approach originally used by Mohri for an algorithm to compute the edit distance. We also give an algorithm to compute the inner prefix distance of a regular language.
KeywordsPolynomial Time Algorithm Edit Distance Regular Language Finite Automaton Edit Operation
- 10.Kari, L., Konstantinidis, S., Perron, S., Wozniak, G., Xu, J.: Computing the hamming distance of a regular language in quadratic time. WSEAS Trans. Inf. Sci. Appl. 1(1), 445–449 (2004)Google Scholar