9212 –Veerammal Engineering College

Department of Computer Science and Engineering

CS 8501 THEORY OF COMPUTATION
Internal Test-1
Time:1 hour 30 Minutes Maximum:50marks
PART-A (5*2=10marks)

1. Show that (r*)*=r* for a Regular Expression r?

2. Find the language accepted by the following automaton?
0 1

1 0 0,1
A B C
1
3. Define Regular Expression?Give an example?
4. Mention the applications of Pumping lemma?
5. Is the set of strings over the alphabet {0} of the form 0 n where n is not a prime is regular?
Prove or disprove.
PART-B (1*8=8marks)

6. Conversion of NFA to DFA (Theorem)

9212 –Veerammal Engineering College

Department of Computer Science and Engineering
CS 8501 THEORY OF COMPUTATION
Internal Test-1
Time:1 hour 30 Minutes Maximum:50marks
1. Show that (r*)*=r* for a Regular Expression r?
2. Find the language accepted by the following automaton?
0 1

1 0 0,1
A B C
1
3. Define Regular Expression?Give an example?
4. Mention the applications of Pumping lemma?
5. Is the set of strings over the alphabet {0} of the form 0 n where n is not a prime is regular?
Prove or disprove.

PART-B (1*8=8marks)
6. Conversion of NFA to DFA (Theorem)
 PART-C (2*16=32marks)

7a) Convert the given NFA with €.

1 2
0
q0 € q1 €
q2

Or

b)Consider following NFA with €.convert it to its INPUT a b c €

STATE
equivalent DFA.
p {p} {q} {r} -
q {q} {r} - {p}
r {r} - {p} {q}
8)a)Consider the following €-NFA or an identifier.Consider the €-closure of each state and
following equivalent DFA.

Or

b)

PART-C (2*16=32marks)

7a) Convert the given NFA with €.

1 2
0
q0 € q1 €
q2

Or

b)Consider following NFA with €.convert it to its INPUT a b c €

STATE
equivalent DFA.
p {p} {q} {r} -
q {q} {r} - {p}
r {r} - {p} {q}
8)a)Consider the following €-NFA or an identifier.Consider the €-closure of each state and
following equivalent DFA.

Or

b)
 Or

b)

ii) Define finite automata & explain in detail.

Or

b) i)Explain proof and it types briefly