State Complexity of Suffix Distance
The neighbourhood of a regular language with respect to the prefix, suffix and subword distance is always regular and a tight bound for the state complexity of prefix distance neighbourhoods is known. We give upper bounds for the state complexity of the neighbourhood of radius k of an n state DFA (deterministic finite automaton) language with respect to the suffix distance and the subword distance, respectively. For restricted values of k and n we give a matching lower bound for the state complexity of suffix distance neighbourhoods.
- 5.Gao, Y., Moreira, N., Reis, R., Yu, S.: A survey on operational state complexity. To appear in Computer Science Review, September 2015. arXiv:1509.03254v1 [cs.FL]
- 9.Kari, L., Konstantinidis, S., Kopecki, S., Yang, M.: An efficient algorithm for computing the edit distance of a regular language via input-altering transducers. CoRR abs/1406.1041 (2014)Google Scholar
- 13.Lothaire, M.: Algorithms on words. In: Applied Combinatorics on Words. Encyclopedia of Mathematics and it’s Applications, vol. 105. Cambridge University Press, New York (2005)Google Scholar