AQA AS Computing: 1.3 Finite State Model Flashcards Preview

AQA AS Computing > AQA AS Computing: 1.3 Finite State Model > Flashcards

Flashcards in AQA AS Computing: 1.3 Finite State Model Deck (6)
Loading flashcards...
1

Finite State Machine

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

2

State Transition Diagram

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

3

Finite State Automaton

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

4

Mealy machine

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

5

State transition table

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

6

Decision table

a table that shows the outcome for a given logical condition