AQA AS Computing: 1.3 Finite State Model

Question 1

Finite State Machine

Answer 1

A machine that consists of a fixed set of possible states, with a set of allowable inputs that change the state, and a set of possible outputs

Question 2

State Transition Diagram

Answer 2

A way of describing a FSM graphically. Each stste is represented by a circle and each transition by an arrow labelled with the input that causes the transition plus any output resulting from the transition

Question 3

Finite State Automaton

Answer 3

A FSM with no outputs. They have an initial state and one or more accepting or goal states

Question 4

Mealy machine

Answer 4

A FSM with outputs which has an initial state and usually no accepting states

Question 5

State transition table

Answer 5

shows the effect on the current state of a FSM of particular inputs and any corresponding outputs

Question 6

Decision table

Answer 6

a table that shows the outcome for a given logical condition