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 . 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.
|Title of host publication||Theoretical Aspects of Computing – ICTAC 2021 - 18th International Colloquium, Proceedings|
|Editors||Antonio Cerone, Peter Csaba Olveczky|
|Number of pages||19|
|Publication status||Published - 2021|
|Event||18th International Colloquium on Theoretical Aspects of Computing, ICTAC 2021 - Virtual, Online|
Duration: 8 Sept 2021 → 10 Sept 2021
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||18th International Colloquium on Theoretical Aspects of Computing, ICTAC 2021|
|Period||8/09/21 → 10/09/21|
Bibliographical notePublisher Copyright:
© 2021, Springer Nature Switzerland AG.
- Parallel algorithm
- Pattern matching
- Set automaton