The Community for Technology Leaders
RSS Icon
Issue No.03 - March (1977 vol.26)
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 ?.
d, t, r, and j partition pairs, delay memory, flip-flop memory, state assignment, synchronous sequential machines, transition sets.
C. Halatsis, G. Philokyprou, "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
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool