Antimirov and Mosses's Rewrite System Revisited

Authors:
Marco Almeida;Nelma Moreira;Rogério Reis
Affiliations:
DCC-FC & LIACC, Universidade do Porto, Porto, Portugal 4169-007;DCC-FC & LIACC, Universidade do Porto, Porto, Portugal 4169-007;DCC-FC & LIACC, Universidade do Porto, Porto, Portugal 4169-007
Venue:
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Year:
2008

Citing 10
Cited 1

Semirings, automata, languages

Semirings, automata, languages
Generating words in a context-free language uniformly at random

Information Processing Letters
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Partial derivatives of regular expressions and finite automaton constructions

Theoretical Computer Science
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Two Complete Axiom Systems for the Algebra of Regular Events

Journal of the ACM (JACM)
Automata and Computability

Automata and Computability
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Follow automata

Information and Computation

FAdo and GUItar

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Antimirov and Mosses proposed a rewrite system for deciding the equivalence of two (extended) regular expressions. In this paper we present a functional approach to that method, prove its correctness, and give some experimental comparative results. Besides an improved version of Antimirov and Mosses's algorithm, we present a version using partial derivatives. Our preliminary results lead to the conclusion that, indeed, these methods are feasible and, generally, faster than the classical methods.