Free groups and regular expressions

Authors:
Peter Johansen
Affiliations:
MIT Electronic Systems Laboratory, Cambridge, Massachusetts
Venue:
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Year:
1969

Citing 3
Cited 0

Roots of Star Events

Journal of the ACM (JACM)
Introduction to Mathematical Machine Theory

Introduction to Mathematical Machine Theory
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Group events are defined as regular events recognized by partial group automata. Canonical forms are introduced for the class of regular expressions denoting group events. Algorithms are presented to find a canonical form from a recognizing automaton, to find a recognizing automaton from a canonical form, and to find a canonical form from a regular expression denoting a simple group event. Furthermore an algorithm is presented that decides whether or not two canonical forms denote the same event.