Finite State Machines A Level Resources

A Level Computer Science: Finite State Machines

This module contains:

  • An editable PowerPoint lesson presentation
  • Editable revision handouts
  • A glossary which covers the key terminologies of the module
  • Topic mindmaps for visualising the key concepts
  • Printable flashcards to help students engage active recall
  • A quiz with answer key to test knowledge and understanding of the module
Compatible with the following examination boards
Finite State Machines A Level Resources Image 1
Finite State Machines A Level Resources Image 2
Finite State Machines A Level Resources Image 3
Finite State Machines A Level Resources Image 4
Finite State Machines A Level Resources Image 5

Download →

Finite State Machines

Previously, two algorithm design methods were introduced: decision table and Jackson structured programming. For modelling logics precisely, a decision table is used. Jackson structured programming (JSP) is another methodology in which structure is developed based on the data used by the program.
In this topic, another algorithm design method, finite state machine, is described in detail. Computer systems are modelled as a finite state machine (FSM) to develop algorithms where its state is transformed based on possible input values. A state transition table maps the different states of FSM.
Further in this topic, a Turning machine, which is an FSM with the ability to write and read data to an unlimited tape, will also be discussed

This A Level Computer Science module introduces finite state machines to your students, explaining:

  • Finite State Machine (FSM)
  • State transition diagram
  • Mealy machine
  • Turing machine
  • Universal machine

More Regular languages and functional programming Modules

Finite State Machines is one lesson in our Regular languages and functional programming module. The other theory lessons can be found below: