This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Periodic Representations and T-Partitionable Equivalents of Sequential Machines
February 1971 (vol. 20 no. 2)
pp. 190-198
This paper deals with the problem of finding nontrivial periodic representations, with not necessarily null transient duration, of deterministic sequential machines. The well-known results in this area, based on means of d-equivalence partitions or regular d-partitions on the set of internal states of a sequential machine A, are generalized. Apart from this, the problem of finding nontrivial periodic representations of A is solved here by the well-known methods of input-independent partitions on the set of internal states of A and by the operation of the (t, T) numeration introduced here.
Index Terms:
Equivalent sequential machines, extension of a sequential machine, input-independent partition on the set of internal states of a sequential machine, periodic machine, periodic representation, T-partitionable equivalent, transition graph.
Citation:
J.W. Grzymala-Busse, "Periodic Representations and T-Partitionable Equivalents of Sequential Machines," IEEE Transactions on Computers, vol. 20, no. 2, pp. 190-198, Feb. 1971, doi:10.1109/T-C.1971.223210
Usage of this product signifies your acceptance of the Terms of Use.