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].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
