3.4.2.1 Finite State Machines Without Output. Flashcards
1
Q
Define a Finite State Machine.
A
FSM:
any device that stores its current status and whose status can change as a result of an input. Mainly used as a conceptual model for designing and describing systems.
2
Q
Define finite.
A
Finite = countable.
3
Q
Define a State Transition Diagram.
A
A visual representation of an FSM using circles and arrows.
4
Q
Define an Accepting State.
A
The state that identifies whether an input has been accepted.
Do not necessarily have an accepting state.
5
Q
Define a State Transition Table.
A
A tabular representation of an FSM showing inputs, current state and next state.
