Brzozowski automaton

In the convention used here, a Brzozowski NFA has one final state, every state can reach it, and each word labels a path to it from exactly one starting state.

Table of contents 75 1
- Irreducibility of the accessible subset automaton Brzozowski automaton 45

 Ancestors (6)

Nondeterministic finite automaton
Formal language theory
Foundations of mathematics
Area of mathematics
Mathematics
 Home