A Set Automaton to Locate All Pattern Matches in a Term

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademic

36 Downloads (Pure)


Term pattern matching is the problem of finding all pattern matches in a subject term, given a set of patterns. Finding efficient algorithms for this problem is an important direction for research [19]. We present a new set automaton solution for the term pattern matching problem that is based on match set derivatives where each function symbol in the subject pattern is visited exactly once. The algorithm allows for various traversal patterns over the subject term and is particularly suited to search the subject term in parallel.
Originele taal-2Engels
StatusGepubliceerd - 29 jun. 2021

Bibliografische nota

Submitted to ICTAC 2021. Contains appendix with proofs


Duik in de onderzoeksthema's van 'A Set Automaton to Locate All Pattern Matches in a Term'. Samen vormen ze een unieke vingerafdruk.

Citeer dit