Brzozowski automaton
= Brzozowski automaton
{c}
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.
= Brzozowski automaton
{c}
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.