DocumentCode :
1112185
Title :
A Study of Trigger Machines
Author :
Hao, Hsieh T. ; Newborn, Monroe M.
Author_Institution :
IBM Advanced Systems Development Division, Yorktown Heights, N.Y., and the Department of Electrical Engineering and Computer Science, Columbia University
Issue :
12
fYear :
1973
Firstpage :
1123
Lastpage :
1131
Abstract :
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.
Keywords :
Canonical circuits, decision procedures, feedback-free circuits, finite-state machines, memory, sequential machines, trigger flip-flops, trigger machines.; Boolean algebra; Circuit testing; Circuits and systems; Computer science; Counting circuits; Delay; Feedback circuits; Flip-flops; Integrated circuit interconnections; Pediatrics; Canonical circuits, decision procedures, feedback-free circuits, finite-state machines, memory, sequential machines, trigger flip-flops, trigger machines.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1973.223658
Filename :
1672251
Link To Document :
بازگشت