This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
General Repetitive Events and Machines
February 1970 (vol. 19 no. 2)
pp. 167-169
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.
Index Terms:
Automaton, finite automaton, general repetitive event, general repetitive machine, repetitive event, repetitive machine.
Citation:
B.G. Reynolds, "General Repetitive Events and Machines," IEEE Transactions on Computers, vol. 19, no. 2, pp. 167-169, Feb. 1970, doi:10.1109/T-C.1970.222887
Usage of this product signifies your acceptance of the Terms of Use.