Abstract Machines

AUTOMATA

The study of self-operating virtual machines. These simple mathematical models are the foundation of all compiler design, pattern matching, and AI behavior.

Level 1: Regular Languages

DFA & NFA

Machines with no memory. They are in exactly one state at a time.

Vending Machines

Traffic Lights

Regular Expressions

Pattern matching text using FSMs.
/^[a-z0-9]+$/i

Level 2: Context-Free

Pushdown Automata

THE STACK

Automata with a "Stack" memory. Capable of parsing nested structures like HTML or Code.

Level 0: Recursively Enumerable

The Turing Machine

Infinite tape. Infinite time. Capable of computing anything that is computable.

Universal Computation

Godel, Escher, Bach

Real World Applications

Compilers

Lexical Analysis

Text Editors

Search & Replace

Game AI

State Behaviors

Hardware

Circuit Design