AQA AS Level Computer Science: Finite State Machines

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/15

flashcard set

Earn XP

Description and Tags

This set of flashcards covers the definitions, graphical and tabular representations, types (Automata vs. Mealy), and practical applications of Finite State Machines based on AQA AS Level Computer Science Unit 2.

Last updated 8:10 PM on 7/6/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

16 Terms

1
New cards

Finite State Machines (FSMs)

A model of computation used to understand how computers work, consisting of a set number of states and transitions between them based on inputs.

2
New cards

Finite State Automata

A type of finite state machine with no output, where the validity of an input sequence is determined by whether it ends in an accept state.

3
New cards

Mealy machines

A type of FSM that generates outputs on each transition and has no particular end state; the output depends on both the current state and the current input.

4
New cards

State Transition Diagram

A graphical way of presenting finite state machines, using notation for start states, transitions, and accept states.

5
New cards

State Transition Table

A tabular representation of a finite state machine that lists the current state, input, and the resulting new state.

6
New cards

Accept State

The final state in an FSM indicating that an input sequence is valid; it is typically represented by a double-circle notation.

7
New cards

Trap State

A state within a finite state machine, such as S3S3 in specific examples, whose purpose is to capture and hold invalid inputs.

8
New cards

Formal Verification

The mathematical analysis of FSMs to ensure correctness, which is crucial in safety-critical systems.

9
New cards

State Minimisation

A feature of Mealy machines that often allows for fewer states than Moore machines to achieve the same logic.

10
New cards

Immediate Reaction

A characteristic of Mealy machines where the output updates during the transition itself rather than after reaching a new state.

11
New cards

Mealy Machine Transition Notation (e.g., 0/1)

A notation where the first value represents the input and the second value represents the output (for instance, input is 00, output is 11).

12
New cards

Vector Angle Formula

cos(θ)=tan(θ)a×b\cos(\theta) = \frac{\tan(\theta)}{|\text{a}| \times |\text{b}|} as used in the starter activity to calculate the angle between two vectors.

13
New cards

Wash State

A state in a washing machine FSM where the machine fills with water, adds detergent, and agitates clothes.

14
New cards

Rinse State

A state in a washing machine FSM where dirty water is drained and the drum is refilled with clean water.

15
New cards

Spin State

A state in a washing machine FSM where the drum rotates at high speed to remove water.

16
New cards

Done State

The final state in a washing machine FSM indicating the cycle is complete and ready for unloading.