AQA A’Level SLR07 Regular expression and FSM
About this video
AQA Specification Reference
A Level 4.4.2.3 - 4.4.2.4
In this video we take a look at the relationship between regular expressions and Finite State Machines (FSMs). We show you how to write a regular expressions for a given FSM and vice versa.
Key question:
- What is the relationship between regular expressions and finite-state machines?
00:00 Regular expression and finite-state machines
00:19 Intro
00:24 Regular expressions and finite-state machines overview
00:47 Example 1
02:20 Example 2
03:55 Key question
04:05 Outro
Last updated: 16.04.25
