Back to Discover
🔢

Finite-state machine

math Maturity 11-13

Some things follow a plan.

Tornelli.jpg
Tornelli.jpg
A gate stays locked. You put in a coin. Now it is open. You push through. Then it locks again. It works like this many times. Can you think of a machine like that?

40 words
🖼️ Images & Media (10)
File:Turnstile state machine colored.svg
Turnstile state machine colored.svg
File:Tornelli.jpg
Tornelli.jpg
File:UML state machine Fig5.png
UML state machine Fig5.png
File:SdlStateMachine.png
SdlStateMachine.png
File:Finite state machine example with comments.svg
Finite state machine example with comments.svg
File:Fsm parsing word nice.svg
Fsm parsing word nice.svg
File:DFAexample.svg
DFAexample.svg
File:Fsm Moore model door control.svg
Fsm Moore model door control.svg
File:Fsm mealy model door control.svg
Fsm mealy model door control.svg
File:4 bit counter.svg
4 bit counter.svg
Up Next
🔢
Turing machine
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Turing machine 0% Pushdown automaton 0% Decision problem 0% Algorithm 0% P (complexity) 0% Discrete mathematics 0%

🔬 Go deeper

More advanced topics to explore

Abstract machine Automata theory Model of computation Turing machine

🪜 Step back

Simpler topics to build understanding

Constructible function Computably enumerable set Turing's proof Disc tumbler lock
📚 Content adapted from Wikipedia | Readability: FK 11.7 | Vital Level 5