General Repetitive Events and Machines

Authors:
B. G. Reynolds
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1970

Citing 3
Cited 0

Derivatives of Regular Expressions

Journal of the ACM (JACM)
Ultimate-Definite and Symmetric-Definite Events and Automata

Journal of the ACM (JACM)
Synchronizations and General Repetitive Machines, with Applications to Ultimate Definite Automata

Journal of the ACM (JACM)

Quantified Score

Hi-index	14.98

Visualization

Abstract

A finite automaton is a general repetitive machine if there is a path in the state graph from every final state to the start state. In this paper general repetitive events are defined in terms of certain factorization properties of the associated regular expressions, and a one-to-one onto correspondence is shown between general repetitive machines and general repetitive events.