1.

Design a DFA over the alphabet {0, 1}, which will accept only those strings whose decimal
representation is a multiple of 5. Draw the transition diagram and transition matrix.
2. Consider the DFA with the following transition matrix and describe the language accepted by
the machine:
0 1
A A B
B B A

3. Design an NFA to accept the set of all strings defined over the alphabet {a, b, c, d} such that
the final character has appeared before. Convert this NFA to a DFA.
4. Consider the following NFA:
ϵ a b c
p {p} {q} {r}
q {p} {q} {r}
r {q} {r} {p}
i) Compute the ϵ-closure of each state
ii) Give all strings of length three or less, that is accepted by the machine
iii) Convert the automaton to a DFA
5. Give English description of the language of the regular expression (1+ ϵ)(00*1)*0*
6. Consider the following transition table for a DFA:
0 1
q1 q2 q1
q2 q3 q1
q3 q3 q2
Draw the transition diagram for this DFA and deduce the regular expression for its language.
7. Convert the regular expression 01* to an NFA with ϵ transition.
8. Consider the transition matrix of a DFA as follows:
0 1
A B A
B A C
C D B
D D A
E D F
F G E
G F G
H G D
Construct the minimum state equivalent DFA
9. Design a CFG for the language {0𝑛 1𝑛 : 𝑛 ≥ 1}
10. Consider the grammar G:

S → A1B

A → 0A | ϵ

B → 0B | 1B | ϵ

a. Write down the regular expression for the language of G

b. Do a leftmost and rightmost derivation of the string 00101
11. Consider the grammar S → aS | aSbS | ϵ. Draw two different parse trees to generate the
string aab.
 12. Construct a pushdown-automata for the language {02𝑚 1𝑚 , 𝑚 ≥ 1} and show the steps to
accept the string 000011.
13. Consider the grammar S → 0S1 | A ; A → 1A0 | S | ϵ.
a. Convert this grammar to CNF and GNF
b. Construct the equivalent PDA
c. Show the steps to accept or reject the string 0101 by this PDA
14. Consider the following Turing Machine

a. Show the IDs when the input tape contains 000111

b. Show the IDs when the Input tape contains 00111

--------------------------------------------------------------------------------------------------------------------------------------

1. What is difference between DFA’s and NFA’s?

2. Differentiate between (a.b) and (a+b).
3. Differentiate between (0+1)*, (01)* and 0*1*.
4. What do you mean by epsilon-transition and epsilon-closure?
5. State Pumping Lemma for Regular Languages and Context Free Languages and explain with
one example each.
6. State the valid productions for a CNF and a GNF.
7. What do you mean by Null Productions and Unit Production? Give examples. How can you
remove these from a grammar.
8. State the formal definitions of Finite Automata, Context Free Grammar, Push Down
Automata and Turing Machine.
9. Differentiate between decidable, undecidable and unsolvable problems.
10. Explain the coding scheme of a Turing Machine with an example.

--------------------------------------------------------------------------------------------------------------------------------------

1. Prove that Regular Expressions are closed under Union, Concatenation and Kleene Closure.
2. State and prove Arden’s Theorem.
3. Prove that a language is regular iff there is a finite automata for the language.
4. Explain the coding scheme of a Turing Machine with a proper example.
5. Prove that if a language L and it’s complement 𝐿̅ are both Recursively Enumerable, then L
must be Recursive.
6. Define Universal Language, and prove that it is non-Recursively Enumerable.