Gates

Jump to bottom

Peter Kagstrom edited this page May 19, 2021 · 5 revisions

Logic Gates

Logic gates are task functions defined by truth tables specific to boolean logic.

Single input gates

Buffer - binary implementation of pass function
Not - binary implementation of task function

Two input gates

And
Or
Nand
Nor
Xor
Xnor

Making a Buffer gate:

Right click on bg -> edit -> new node
Right click on node -> edit -> name 'buffer gate'
Right click on 'buffer gate' -> abstract to abstract into a graph
Right click on graph to functionalize
Enter 1 to input node
Right click on function -> abstract -> evaluate
Receive 1 from output node

Making a Not gate:

Right click on bg, add new node
Right click on node name to edit to 'not gate'
Right click on 'not gate' node to abstract into a graph
Right click on graph to functionalize
Right click on edge in graph to functionalize
Define function as mapping:

Input	Output
0	1
1	0

Enter 0 to input node
Right click on function -> abstract -> evaluate
Receive 1 from output node

Making an And gate:

Right click on bg, add new node
Right click on node name to edit to 'and gate'
Right click on 'and gate' node to abstract into a graph
Right click on graph to functionalize
Right click on edge in graph to functionalize
Define function as mapping:

Input	Output
(0, 0)	1
(0, 1)	0
(1, 0)	0
(1, 1)	1

Enter (0, 0) to input node
Right click on function -> abstract -> evaluate
Receive 1 from output node