Automata Simulator

AUTOMATA

◈ DFA Definition

States (comma-separated)

Alphabet — letters, digits, or any symbols

Start State

Accept States

Transitions — state,symbol→next one per line

▶ Test String

Input — each character is one alphabet symbol

◈ NFA Definition

States

Alphabet (use ε for epsilon)

Start State

Accept States

Transitions — multiple targets: q0,a→q0,q1

▶ Test String

Input string (letters, digits, etc.)

⚡ Thompson Construction

Regular Expression

| union * Kleene star + one-or-more ? optional () groups

✦ Pattern Builder

Alphabet (comma-separated symbols)

Pattern Category

Prefix string (e.g. ab or 01)

Suffix string (e.g. ba or 00)

Substring to search for

Symbol to count (single character)

First symbol

Second symbol

Count N

N

Number base (2 = binary, 10 = decimal)

◈

Build an automaton to visualize it here

Execution Trace

Run a simulation to see the step-by-step trace.