Kjell Lemström, Lauri Hella. Approximate Pattern Matching is Expressible in Transitive Closure Logic. In LICS. pages 157-167, 2000. [doi]
@inproceedings{LemstromH00,
title = {Approximate Pattern Matching is Expressible in Transitive Closure Logic},
author = {Kjell Lemström and Lauri Hella},
year = {2000},
url = {http://www.computer.org/proceedings/lics/0725/07250157abs.htm},
tags = {pattern matching, logic},
researchr = {https://researchr.org/publication/LemstromH00},
cites = {0},
citedby = {0},
pages = {157-167},
booktitle = {LICS},
}