This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Study of Trigger Machines
December 1973 (vol. 22 no. 12)
pp. 1123-1131
H.T. Hao, IBM Advanced Systems Development Division, Yorktown Heights, N.Y., and the Department of Electrical Engineering and Computer Science, Columbia University
A synchronous sequential machine realizable in the form of a loop-free circuit of trigger flip-flops and combinational gates is called a trigger machine. This paper studies the properties of this class of machines. Most importantly, canonical circuit forms and canonical algebraic representations are presented. Other basic properties of trigger machines, many of which closely parallel those of definite machines, are also presented. It is shown that the class of trigger machines forms a Boolean algebra and that, unlike definite machines, they are closed under reversal.
Index Terms:
Canonical circuits, decision procedures, feedback-free circuits, finite-state machines, memory, sequential machines, trigger flip-flops, trigger machines.
Citation:
H.T. Hao, M.M. Newborn, "A Study of Trigger Machines," IEEE Transactions on Computers, vol. 22, no. 12, pp. 1123-1131, Dec. 1973, doi:10.1109/T-C.1973.223658
Usage of this product signifies your acceptance of the Terms of Use.