The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1972 vol.21)
pp: 502-503
I. Tomescu , Department of Mathematics, University of Bucharest
ABSTRACT
In this note a matrix method is given that enables one to determine all pairs of compatible states in the case of incompletely specified sequential automata.
INDEX TERMS
Boolean matrix, compatible states, sequential machine.
CITATION
I. Tomescu, "A Matrix Method for Determining All Pairs of Compatible States of a Sequential Machine", IEEE Transactions on Computers, vol.21, no. 5, pp. 502-503, May 1972, doi:10.1109/T-C.1972.223550
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool