We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED.
- Authors
ALMEIDA, MARCO; MOREIRA, NELMA; REIS, ROGÉRIO
- Abstract
Antimirov and Mosses proposed a rewrite system for deciding the equivalence of two (extended) regular expressions. They argued that this method could lead to a better average-case algorithm than those based on the comparison of the equivalent minimal deterministic finite automata. In this paper we present a functional approach to that method, prove its correctness, and give some experimental comparative results. Besides an improved functional version of Antimirov and Mosses's algorithm, we present an alternative one using partial derivatives. Our preliminary results lead to the conclusion that, indeed, these methods are feasible and, most of the time, faster than the classical methods.
- Subjects
REWRITING systems (Computer science); MACHINE theory; MATHEMATICAL logic; MATHEMATICAL models; SEQUENTIAL machine theory; ALGORITHMS
- Publication
International Journal of Foundations of Computer Science, 2009, Vol 20, Issue 4, p669
- ISSN
0129-0541
- Publication type
Article
- DOI
10.1142/S0129054109006802