Theory of computation Flashcards
1
Q
Finite State Machines
A
computational model for a machine that is always in a fixed state. each FSM has a finite number of states and can only ever be in 1 at any given moment
2
Q
Mealy machine
A
FSM with outputs
