A Procedure for Checking Equality of Regular Expressions

Authors:
A. Ginzburg
Affiliations:
Carnegie Institute of Technology, Pittsburgh, Pa and Technion, Israel Institute of Technology, Haifa, Israel
Venue:
Journal of the ACM (JACM)
Year:
1967

Citing 2
Cited 4

Derivatives of Regular Expressions

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

Journal of the ACM (JACM)

Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of regular(-like) expressions

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Regular expression containment: coinductive axiomatization and computational interpretation

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Multi-tilde-bar derivatives

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple “mechanical” procedure is described for checking equality of regular expressions. The procedure, based on the work of A. Salomaa, uses derivatives of regular expressions and transition graphs.Given a regular expression R, a corresponding transition graph is constructed. It is used to generate a finite set of left-linear equations which characterize R. Two regular events R and S are equal if and only if each constant term in the set of left-linear equations formed for the pair (R S) is (&phgr; &phgr;) or (^ ^).The procedure does not involve any computations with or transformations of regular expressions and is especially appropriate for the use of a computer.