Finite State Machines

AQA 75174.4.2.1A-levelLesson packFree

Page 1 of the Finite State Machines preview — 1 of 4 in the preview

About this resource

Lesson pack for AQA A-level Computer Science (7517), 4.4 Theory of computation: slides, student worksheet, answers.

Unit bundlePaper 1

Part of: Paper 1: the whole unitEvery resource in the unit in one zip.

More from 4.4 Theory of computation

Lesson pack · 4.4.1Abstraction and AutomationSubscription
Lesson pack · 4.4.2Sets, Regular Expressions and Regular LanguagesSubscription
Lesson pack · 4.4.3.1Context-Free Languages: BNF and Syntax DiagramsSubscription
Lesson pack · 4.4.4Classification of Algorithms (Big-O, Tractability, Halting)Subscription
Lesson pack · 4.4.5.1Turing MachinesSubscription
Knowledge organiser · 4.4Theory of Computation (Part 1) — Abstraction, Automation & Finite State MachinesFree
Knowledge organiser · 4.4Theory of Computation (Part 2) — Sets, Regular Expressions & BNFSubscription
Knowledge organiser · 4.4Theory of Computation (Part 3) — Classification of Algorithms & Turing MachinesSubscription