mNo edit summary |
(The table doesn't align images with text, testing things to fix that) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
{| style="border-collapse: collapse;" | {| class="wikitable" style="border-collapse: collapse;" | ||
|- | |- | ||
| [[File:WD GuideLink.png|frameless|center | | [[File:WD GuideLink.png|frameless|center|link=Building Circuits with Words|alt=Building Circuits with Words|110x110px]]|| style="padding-left:12px;max-width:20em" | '''Building Circuits with Words'''<br><br>A guide for beginners about transfering descriptions of a truth table into a circuit. | ||
|- | |- | ||
| [[File:KV GuideLink.png|frameless|center | | [[File:KV GuideLink.png|frameless|center|link=K-map|alt=K-maps|110x110px]]|| style="padding-left:12px;max-width:20em" | '''K-maps'''<br><br>A K-Map or Karnaugh-Veitch-Diagramm is a technique to build a small circuit for 4 input variables. | ||
|- | |- | ||
| [[File:SM GuideLink.png|frameless|center | | [[File:SM GuideLink.png|frameless|center|link=State Machines -or- How to solve the maze with 2 gates|alt=State Machines-or-How to solve the maze with 2 gates|110x110px]]|| style="padding-left:12px;max-width:20em" | '''State Machines -or-<br>How to solve the maze with 2 gates'''<br><br>A guide about state machines and how they can be used to solve the maze level with only 2 gates. | ||
|} | |} | ||
Latest revision as of 04:39, 1 December 2023
 |
Building Circuits with Words A guide for beginners about transfering descriptions of a truth table into a circuit. |
 |
K-maps A K-Map or Karnaugh-Veitch-Diagramm is a technique to build a small circuit for 4 input variables. |
 |
State Machines -or- How to solve the maze with 2 gates A guide about state machines and how they can be used to solve the maze level with only 2 gates. |
Pages in category "Guide"
The following 4 pages are in this category, out of 4 total.