automataStudio

Untitled DFA

DFASaved locally

Convert automata

Convert a regular expression or finite automaton.

THOMPSON CONSTRUCTION

Start with an expression

Union | · concatenation · repetition * + ? · groups () · empty input ε · empty language ∅. Escape operators with a backslash.

CURRENT MACHINE

Untitled DFA

Convert an NFA or ε-NFA with subset construction. Minimize a DFA by refining state partitions.

FORMAL PRODUCT

Find the language intersection

Combine the current finite automaton with a saved machine. The result accepts a string only when both inputs accept it. NFA inputs are determinized first.