# Example of Conversion of Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA) – 4

**Example :**Given below is the NFA for a language L= {Set of all string over (0, 1) that ends with 01 } construct its equivalent DFA.

**Example :**Given below is the NFA for a language L= {Set of all string over (0, 1) that ends with 01 } construct its equivalent DFA.