Finite State Machines

Lesson notes

Overview

A machine with finitely many states reads symbols and changes state: used in parsers and game AI. This topic is rated advanced and is number 51 of 117 in Computer Science. Deeper models, formal results and harder reasoning.

What you are seeing

The panel above shows an interactive animation of the idea. Every slider changes one quantity so you can see its effect on the outcome. The animation is drawn live from the model, so everything you see responds to the sliders. Press Space to pause, use Restart to replay from the start, and change the speed to slow down quick events.

In depth

A finite state machine has a finite set of states, an input alphabet and rules that say which state to move to when a symbol is read, defined by (Q, Σ, δ, q₀, F). It starts in a start state and accepts an input if it ends in an accepting state. They are used to model traffic lights, vending machines, game character behaviour and lexical analysis in compilers. They are the simplest model of computation and recognise exactly the regular languages.

Reading the relationship

The expression "(Q, Σ, δ, q₀, F)" is a compact summary of the idea. It uses the symbols Q, Σ, δ, q₀, F; name what each one stands for before you start. Notice that it contains a sum, so many small contributions are added together. Then use the sliders to see how changing one quantity changes the others.

A guided exploration

1. Run the animation once with the default settings and describe in words what happens. 2. Change one slider at a time and note which quantity responds most. 3. Push each slider to its extreme and decide whether the result still makes sense.

Try this

Try to explain why the pattern holds, not just what it is. Look for limiting cases and what happens at the edges.

Common pitfalls

Test small inputs by hand and then the largest ones. Off-by-one errors and forgetting how cost grows with input size are the most common traps.

How it connects

It builds on “Training a Linear Model”, the topic before it in Computer Science. Once you are comfortable, continue with “Parity Checker Automaton”.

Why it matters

Computing ideas decide how fast, how safely and how well software can solve problems.