A Level Computer Science: Finite State Machines
This module contains:
Compatible with the following examination boards
Download A Level Module 57: Finite State Machines
This download is exclusively for Teach Computer Science subscribers!
To download this file, click the button below to signup (it only takes a minute) and you'll be brought right back to this page to start the download!
Already a member? Log in to 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:
