ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED

• Type: Article in International Scientific Journal
• Date: 2009

Authors

Marco Almeida (Author) Other; Nelma Moreira (Author) FCUP; Rogerio Reis (Author) FCUP

Journal

Title: International Journal of Foundations of Computer Science

Vol. 20

Pages: 669-684

ISSN: 0129-0541

Publisher: World Scientific

Indexing

ISI Web of Knowledge - 6 Citations

Scopus - 2 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-003-H2V

DOI: 10.1142/s0129054109006802

Abstract (EN): 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 16