A-Level Computer Science Revision — Finite State Machines
Revise Finite State Machines for A-Level Computer Science with a topic explanation, worked example and common mistakes. Check the board notes for specification differences.
At a glance
- What StudyVector is
- An exam-practice platform with board-aligned questions, explanations, and adaptive next steps.
- This topic
- Finite State Machines in A-Level Computer Science: explanation, examples, and practice links on this page.
- Who it’s for
- Students revising A-Level Computer Science for UK exams.
- Exam boards
- Check your course page and the topic board notes for supported specifications.
- Free plan
- Sign up free to use tutor paths and feedback on your answers. Free access is Free daily revision · No card required. Pricing
- What makes it different
- Syllabus-shaped practice and progress tracking—not generic AI answers.
This page includes a topic explanation and a worked example. Check your course for current practice coverage.
Next in this topic area
Next step: Regular & Context-Free Languages
Continue in the same course — structured practice and explanations on StudyVector.
Go to Regular & Context-Free LanguagesTopic explanation
What is Finite State Machines?
A Finite State Machine (FSM) is a mathematical model of computation used to design both computer programs and sequential logic circuits. It is an abstract machine that can be in exactly one of a finite number of states at any given time, and can transition from one state to another in response to some external inputs.
Board notes: Covered by AQA, Edexcel, and OCR. AQA and OCR students are expected to be able to design and interpret FSMs from a description of a problem.
Step-by-step explanationWorked examples
Worked example
A vending machine can be modelled as an FSM. It has states for 'Idle', 'CoinInserted', and 'ItemDispensed'. An input of a coin transitions it from 'Idle' to 'CoinInserted'. Selecting an item transitions it to 'ItemDispensed' and then back to 'Idle'.
Practise this topic
Start with low-focus cards for Finite State Machines, then move into full exam-style practice when you want the heavier session.
Common mistakes
- 1Forgetting to include a start state or final (accepting) states.
- 2Creating non-deterministic FSMs when a deterministic one is required.
- 3Incorrectly drawing the state transition diagram, for example, by missing transitions for some inputs.
Finite State Machines exam questions
Check the available question sets for Finite State Machines. Use your course and exam board to confirm which practice is relevant.
Finite State Machines exam questionsGet help with Finite State Machines
Get a personalised explanation for Finite State Machines from the StudyVector tutor. Ask follow-up questions and work through problems with step-by-step support.
Open tutorSave your progress in Finite State Machines
Start a free account for low-focus question cards, feedback and Play routes across available topics. Free daily limits apply; no card required.
Continue your revision
A public question for Finite State Machines is still being reviewed. Your course page shows the topics currently available for practice.
Continue with Finite State Machines
Create a free account to keep your course choice and save your practice progress.
Start free low-focus cardsAlready have an account? Log in
Frequently asked questions
What is the difference between a Mealy machine and a Moore machine?
In a Moore machine, the output is determined only by the current state, while in a Mealy machine, the output is determined by both the current state and the current input.
Can a finite state machine have no final states?
Yes, an FSM can have zero or more final states. If it has no final states, it can never be in an accepting state.