Assignment
BTCS501 Theory of Computation
1. Differentiate between DFA and NFA.
2. Differentiate between regular expression and regular language
3. Tabulate the regular expression for the following L1=set of strings 0 and 1 ending in 00 L2=set
of all strings 0 and 1 beginning with 0 and ending with 1
4. Describe what are non-deterministic finite automata and the applications of automata
theory.
5. Illustrate a regular expression for the set of all strings of 0’s and 1’s not containing 101 as
substring.
6. What are the closure properties of regular languages?
7. Define ε-NFA
8. Summarize minimization of DFA
9. Give the non-deterministic automata to accept strings containing the substring 0101.
10. Illustrate if L be a set accepted by an NFA then there exists a DFA that accepts L.
11. Explain a finite automaton for the regular expression 0*1*.
12. Develop a pumping lemma for regular set and what are the applications of pumping
Lemma.
13. Construct a minimum state automaton equivalent to the finite automaton described by Fig.
