Tutorial-1 on Finite Automata
Q1. For the given NFA which of the following is the equivalent DFA:
Q2. Consider the following NFA and answer the following:
a) Compute the ε-closure of each state.
b) Convert the automaton to a DFA.
Q3. Consider the following ε-NFA and do the following:
a) Compute the ε-closure of each state.
b) Convert the automaton to a DFA.
Q4. Constructure the Finite Automata from the following 5-tuple notation:
Q5. Convert the given ε-NFA to its equivalent DFA:
