This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
J.A. Brzozowski, "R70-44 Synchronization and General Repetitive Machines, with Applications to Ultimate Definite Automata," IEEE Transactions on Computers, vol. 19, no. 10, pp. 989-990, October, 1970.
 
 
BibTex
x
 
@article{ 10.1109/T-C.1970.222817,
author = {J.A. Brzozowski},
title = {R70-44 Synchronization and General Repetitive Machines, with Applications to Ultimate Definite Automata},
journal ={IEEE Transactions on Computers},
volume = {19},
number = {10},
issn = {0018-9340},
year = {1970},
pages = {989-990},
doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1970.222817},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - R70-44 Synchronization and General Repetitive Machines, with Applications to Ultimate Definite Automata
IS - 10
SN - 0018-9340
SP989
EP990
EPD - 989-990
A1 - J.A. Brzozowski,
PY - 1970
KW - null
VL - 19
JA - IEEE Transactions on Computers
ER -
 
J.A. Brzozowski, Dept. of Appl. Analysis and Computer Sci. University of Waterloo
The authors define a general repetitive machine (GRM) as a finite automaton in which the initial state can be reached from every final state. If there exists a tape which takes all final states to the initial state, the automaton is called a repetitive machine (RM). The RM's constitute a proper subclass of the GRM's. The first result is that a GRM is either strongly connected or it has a nonaccepting dead state, and the remaining states form a strongly connected subset.
Citation:
J.A. Brzozowski, "R70-44 Synchronization and General Repetitive Machines, with Applications to Ultimate Definite Automata," IEEE Transactions on Computers, vol. 19, no. 10, pp. 989-990, Oct. 1970, doi:10.1109/T-C.1970.222817
Usage of this product signifies your acceptance of the Terms of Use.