Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A Study of Trigger Machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hao, H.T. ; IBM Advanced Systems Development Division, Yorktown Heights, N.Y., and the Department of Electrical Engineering and Computer Science, Columbia University ; Newborn, Monroe M.

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-22 ,  Issue: 12 )