regular-languages

1 free lesson tagged regular-languages across Computer Science. Each one is a short sequence of focused steps with narration and a five-question quiz at the end — take them in any order, no signup required.

Computer Science

intermediate

Finite Memory and What It Cannot Recognise

A machine with a fixed number of states can recognise a surprising amount, and then hits a wall that no amount of cleverness moves. This lesson builds the finite automaton, shows that regular expressions are the same thing in different notation, and proves by counting that balanced parentheses are out of reach.

9 steps·~14 min

Finite Memory and What It Cannot Recognise

Related topics