AQA AS Computing: 1.3 Finite State Model Flashcards

1
Q

Finite State Machine

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

State Transition Diagram

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Finite State Automaton

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Mealy machine

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

State transition table

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Decision table

A

a table that shows the outcome for a given logical condition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly