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

**Example : **Design a NFA for a language that accepts all string over {0,1}, in which the second last symbol is always 1. Then convert it to its equivalent DFA.