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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.