Issue No. 02 - February (1970 vol. 19)
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.
Automaton, finite automaton, general repetitive event, general repetitive machine, repetitive event, repetitive machine.
B. Reynolds, "General Repetitive Events and Machines," in IEEE Transactions on Computers, vol. 19, no. , pp. 167-169, 1970.