-
What is included in a state machine?
M = (S, I, O, f, g, ,s0)
- S = A finite set of states
- I = An input alphabet
- O = Output alphabet
- f = A transition function assigning the next state for every input
- g = Function assigning the Output for every input given.
- s0 = A Staring State
-
Give example of what state machines are used for?
They are used in spelling programs and word searching. Easy to validate strings etc.
-
What two ways can be used to visualize state machines?
State machine tables or state machine diagrams.
-
Draw up a state machine for with 5 states I=[0,1] O=[0,1] with both a f and g function.
-
Explain the How and why we can say that
g(x) = y where y is the output corresponding to the input string x.
-
-
-
Create a finite state machine for subtraction.
GET HELP?
-
|
|