4.4.2 - ToC (Finite State Machines) Flashcards
1
Q
What is meant by a finite state machine
A
machine that ‘models the computation of real-life machines’ consisting of a fixed set of possible states
2
Q
What symbolises a starting state
A
A state that has an arrow coming from nowhere pointing to it
3
Q
What symbolises an accepting state
A
A state that with 2 circles
4
Q
What does an accepting state mean
A
A state that the FSM can terminate at
5
Q
How is a transition displayed on a FSM diagram
A
An arrow going from one state to another with a condition attached to it
6
Q
How are inputs and output displayed
A
input | output
7
Q
What is meant by a mealy machine
A
- A FSM with an output for each transition
8
Q
What are the outputs determined by in a mealy machine
A
- Its current state
- Its input
