discrete mathematics - What is the easiest way to determine the accepted language of a deterministic finite automaton (DFA)? - Mathematics Stack Exchange
Example of Conversion of Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA) – 5 – Selman ALPDÜNDAR