Y12 · Computer Science · 4.4.2.2

Sets & Maths for Regular Expressions

AQA & OCR A-Level Computer Science

Sets & Notation Empty Set Set Comprehension String Sets (0ⁿ1ⁿ) Cardinality Cartesian Product
Question 1 of 10 Score: 0

Topic Breakdown

About this resource · A-Level

The maths behind regular expressions

Before regular expressions and regular languages make sense, you need to be comfortable with set notation. That means the empty set, membership, subsets, set comprehension like { x | x ∈ ℕ ∧ x < 5 }, cardinality, and the Cartesian product of two sets.

You'll also meet sets of strings such as { 0ⁿ1ⁿ | n ≥ 1 }. This language can't be described by a regular expression or recognised by a finite state machine, which leads into the limits of computation later in the course.

The quiz covers each area with a topic breakdown at the end, so you can target revision where it's needed.

Exam tips

Specification

Maths for regular expressions (4.4.2.2), AQA 7517.

Related resources

Browse all free Computer Science resources →

Want one-to-one help with this topic? I'm Damian Biasone, a qualified Computer Science teacher with 20 years' experience, tutoring GCSE and A-Level students online.

AQA A-Level (7517) tuition