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]

Authors

Kjell Lemström

This author has not been identified. Look up 'Kjell Lemström' in Google

Lauri Hella

This author has not been identified. Look up 'Lauri Hella' in Google