This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Existence Algorithms for Synchronizing/Distinguishing Sequences
March 1981 (vol. 30 no. 3)
pp. 234-237
null Sung Je Hong, Department of Computer Science, University of Illinois
This correspondence describes two efficient algorithms for determining whether or not a given finite-state machine has a synchronizing sequence and a distinguishing sequence, respectively, and compares them with the well-known tree method. Compared with the tree method, these new algorithms are easier to implement and require less memory size. Since they do not require keeping and searching a look-back directory, they allow significant speed improvements.
Index Terms:
tree method, Distinguishing sequence, existence algorithm, finite-state machine, state-identification, successor tree, synchronizing sequence
Citation:
null Sung Je Hong, "Existence Algorithms for Synchronizing/Distinguishing Sequences," IEEE Transactions on Computers, vol. 30, no. 3, pp. 234-237, March 1981, doi:10.1109/TC.1981.1675761
Usage of this product signifies your acceptance of the Terms of Use.