1. Pattern matching in hypertext;Amir;Journal of Algorithms,2000
2. Descriptional complexity of error/edit systems;Kari;J. Automata, Languages and Combinatorics,2004
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. Computing the Hamming distance of a regular language in quadratic time;Kari;WSEAS Transactions on Information Science and Applications,2004
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.