411 REFERENCE · Wikibooks
A-level Computing/AQA/Problem Solving, Programming, Operating Systems, Databases and Networking/Problem Solving/Finite State Machines
Reference material by Wikibooks contributors. This retains its source identity and is not 411 news reporting.
Turing Machines
Backus-Naur Form (BNF)
Finite State Machines in unit 3 are exactly alike as you have learnt from unit 1. They are just slightly more complex with a few more states. To recap your memory, visit the unit 1 page here.
A-level Computing/AQA/Problem Solving, Programming, Data Representation and Practical Exercise/Problem Solving/Finite state machines Finite State Machines