Name
Title | ||
|---|---|---|
On the Problem of Finding d, t, r, and j Type Partition Pairs of a Sequential Machine |
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 t which are in "d","t","r", and "j" relation with a given partition ?. |
Year | DOI | Venue |
|---|---|---|
1977 | 10.1109/TC.1977.1674824 | IEEE Transactions on Computers |
Keywords | DocType | Volume |
various type,new unified approach,sequential machine,j type partition pairs,partition pair,new approach,key factor,t,r | Journal | C-26 |
Issue | ISSN | Citations |
3 | 0018-9340 | 0 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. Philokyprou | 1 | 61 | 10.90 |
| C. Halatsis | 2 | 0 | 0.34 |
| N. Gaitanis | 3 | 117 | 19.48 |