Work

Dynamic Deterministic Pattern-Matching

Year: 2000

Type: article

Abstract: Efficient term matching techniques are pre-requisite for practical term rewriting systems, compilers and interpreters. In previous work, we proposed a new technique to construct deterministic and optimal pattern-matching automata [8–11]. As an important result of our work, we now show how deterministic pattern-matching automata can be constructed incrementally. This is important for applications in which the pattern set changes dynamically. A famous example of such an application is the Knuth-Bendix completion algorithms [7].

Source: Electronic Notes in Theoretical Computer Science

DOI: 10.1016/s1571-0661(05)80335-4

Authors: Nadia Nedjah, Luiza de Macedo Mourelle

Institution: Universidade do Estado do Rio de Janeiro

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2075806155

FWCI: 0.44

Cites: 10

Cited by: 5

Related to: 10