This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Problem of Finding d, t, r, and j Type Partition Pairs of a Sequential Machine
March 1977 (vol. 26 no. 3)
pp. 294-297
G. Philokyprou, Computer Center, NRC Democritos
This correspondence presents a new unified approach for defining and finding the various types of partition pairs ("d", "t","r","j") of a sequential machine. The notion of separation (distinguishability) of states is the key factor of the new approach. By this and the notion of transition sets one can easily find all maximal partitions t which are in "d","t","r", and "j" relation with a given partition ?.
Index Terms:
d, t, r, and j partition pairs, delay memory, flip-flop memory, state assignment, synchronous sequential machines, transition sets.
Citation:
G. Philokyprou, C. Halatsis, N. Gaitanis, "On the Problem of Finding d, t, r, and j Type Partition Pairs of a Sequential Machine," IEEE Transactions on Computers, vol. 26, no. 3, pp. 294-297, March 1977, doi:10.1109/TC.1977.1674824
Usage of this product signifies your acceptance of the Terms of Use.