On the Problem of Finding d, t, r, and j Type Partition Pairs of a Sequential Machine | IEEE Journals & Magazine | IEEE Xplore

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 o...Show More

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 ρ.
Published in: IEEE Transactions on Computers ( Volume: C-26, Issue: 3, March 1977)
Page(s): 294 - 297
Date of Publication: 31 March 1977

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.