08:58 duration 8 minutes 58 seconds
CL - 13b - regex and FSM
We introduce some simple finite state machines, and three key ideas of the theory.The first idea is that of the language recognised by a machine. Given an alphabet of symbols, a language is a set…