Approximate Pattern Matching is Expressible in Transitive Closure Logic

Kjell Lemström, Lauri Hella. Approximate Pattern Matching is Expressible in Transitive Closure Logic. In LICS. pages 157-167, 2000. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: