Abstract
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.
Cite
CITATION STYLE
Ng, T. (2016). Prefix distance between regular languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9705, pp. 224–235). Springer Verlag. https://doi.org/10.1007/978-3-319-40946-7_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
