cs 4.2. Flashcards
(3 cards)
1
Q
FSM
A
model of computation
each fsm has finite no. of state and a read/write head and a tape
2
Q
State transition diagrams
A
visual representation of FSM
consist of states(circles), transitions (arrows), and start state(circle with arrow) and an accepting state (double circle)
Only has inputs
3
Q
State transition table
A
e.g.
Current state | Input | Next state
S0 1 S1
S0 0 S2