A Set Automaton to Locate All Pattern Matches in a Term

Term Rewriting Based On Set Automaton Matching

“…In Section 2 we present some preliminary definitions. In Section 3 we recall the set automaton matching technique from [12]. Then we discuss a basic version of the rewriting procedure based on this matching technique in Section 4.…”

“…Section 9 covers the construction of a set automaton. The details are mostly copied from [12], but we added additional explanations and most importantly, a method to create a set automaton that enables outermost pattern matching. Section 10 includes a proof of this method.…”

“…We recall set automata from [12]. Space limitations prevent us from recalling and explaining the construction of such an automaton in this article.…”

“…The contribution of this paper is a rewriting procedure based on the set automaton pattern matching technique [12] which generalises the Aho-Corasick algorithm [1] to tree patterns. As a preprocessing step, a set automaton is constructed from the left-hand sides of a rewrite system.…”

“…

In previous work we have proposed an efficient pattern matching algorithm based on the notion of set automaton [12]. In this article we investigate how set automata can be exploited to implement efficient term rewriting procedures.

…”