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.


Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.