Toggle search
Search
Toggle menu
notifications
Toggle personal menu
Editing
User:Gelthor/sandbox
From Turing Complete
Views
Read
Edit
Edit source
View history
associated-pages
User page
Discussion
More actions
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{guide|narrow=1|nocategory=1}} <templatestyles src="Gelthor/test.css" /> '''Prerequisites: '''<br> ''Make sure you completed '''The Maze''' level. I also use KV diagrams later on, so you might check out this guide before: '''[[K-map]]''' == The idea - what is a state machine? == Imagine you have to build a circuit to control some kind of device. You don't have a full computer - only basic gates, and need to come up with a solution, so that your device behave the way you want it to. The idea is, that we go over all possible things that our device can do step-by-step. We draw a circle for each of those steps and call it a '''state'''. Usually every possible output that our device can have has at least one state. We then connect this circles by arrows that have a certain condition assigned to it (called '''transitions'''). These conditions are usually a specific configuration of input signals (What shall the device do when certain inputs arrive). This means something like that:<br> ''We go from state A to state B, when the condition on the arrow from A to B is met.'' [[File:State basic.png]] By doing so, we can construct a picture where the complete behaviour is visible for us and we can understand it easily (= '''state machine'''). The cool thing is: There is a completely deterministic way to convert this pictures to circuits by following a few steps, and your device will do exactly what you specified in the picture. It is so straight forward, that you can technically write a program that converts state machines to circuits. == Tables == {| {{truthtable}} ! [[File:Symbol I1.png]] !! [[File:Symbol I0.png]] !! means |- | [[File:Off.png|24px]] || [[File:Off.png|24px]] || Free |- | [[File:Off.png|24px]] || [[File:On.png|24px]] || Wall |- | [[File:On.png|24px]] || [[File:On.png|24px]] || Door |- | [[File:Symbol Dc.png|24px]] || [[File:Symbol Dc.png|24px]] || Always (we don't care about the value of the input) |} {| class="truthtable" ! [[File:Symbol I1.png]] !! [[File:Symbol I0.png]] ! style="width:50px;"|means | |- | [[File:Off.png|24px]] || [[File:Off.png|24px]] || Free |- | [[File:Off.png|24px]] || [[File:On.png|24px]] || Wall |- | [[File:On.png|24px]] || [[File:On.png|24px]] || Door |- | [[File:Symbol Dc.png|24px]] || [[File:Symbol Dc.png|24px]] |colspan="2"| Always (we don't care about the value of the input) |}
Summary:
Please note that all contributions to Turing Complete are considered to be released under the Creative Commons Attribution-ShareAlike (see
TuringComplete:Copyrights
for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource.
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Templates used on this page:
Template:Gelthor/test.css
(
edit
)
Template:Guide
(
edit
)
Template:Guide/narrow.css
(
edit
)
Template:Truthtable
(
edit
)
Template:Truthtable/styles.css
(
edit
)