DocumentCode
1134455
Title
On the Problem of Finding d, t, r, and j Type Partition Pairs of a Sequential Machine
Author
Philokyprou, G. ; Halatsis, C. ; Gaitanis, N.
Author_Institution
Computer Center, NRC Democritos
Issue
3
fYear
1977
fDate
3/1/1977 12:00:00 AM
Firstpage
294
Lastpage
297
Abstract
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 τ which are in "d","t","r", and "j" relation with a given partition ρ.
Keywords
d, t, r, and j partition pairs, delay memory, flip-flop memory, state assignment, synchronous sequential machines, transition sets.; Delay; Equations; Flip-flops; d, t, r, and j partition pairs, delay memory, flip-flop memory, state assignment, synchronous sequential machines, transition sets.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1977.1674824
Filename
1674824
Link To Document