Automata

Precedence

Kleene closure > concatenation > union

DFA/NFA

DFA: only one path for a given letter from a given state, no epsilon transitions are allowed
NFA: one or more paths for a given letter from a given state, may have epsilon transitions