Abstract
We investigate the parameterized prefix distance between regular languages. The prefix distance between words is extended to languages in such a way that the distances of all words up to length n to the mutual other language are summed up. Tight upper bounds for the distance between unary as well as non-unary regular languages are derived. It is shown that there are pairs of languages having a constant, degree k polynomial, and exponential distance. Moreover, for every constant and every polynomial, languages over a binary alphabet are constructed that have exactly that distance. From the density and census functions of regular languages the orders of possible distances between languages are derived and are shown to be decidable. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Kutrib, M., Meckel, K., & Wendlandt, M. (2014). Parameterized prefix distance between regular languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8327 LNCS, pp. 419–430). Springer Verlag. https://doi.org/10.1007/978-3-319-04298-5_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
