A Set Automaton to Locate All Pattern Matches in a Term

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 [21]. We present a new set automaton solution for the term pattern matching problem that is based on ma...

Full description

Saved in:
Bibliographic Details
Published inTheoretical Aspects of Computing - ICTAC 2021 Vol. 12819; pp. 67 - 85
Main Authors Erkens, Rick, Groote, Jan Friso
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2021
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Parallel algorithm
Pattern matching
Set automaton
Online AccessGet full text

Cover

More Information
Summary: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 [21]. 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.
ISBN:3030853144
9783030853143
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-030-85315-0_5