Вы находитесь на странице: 1из 1

KNOWLEDGE INSTITUTE OF TECHNOLOGY, SALEM-637 504 KNOWLEDGE INSTITUTE OF TECHNOLOGY, SALEM-637 504

Department of Computer Science and Engineering Department of Computer Science and Engineering
PET – III PET – III
CS8501 – THEORY OF COMPUTATION CS8501 – THEORY OF COMPUTATION
III YEAR CSE III YEAR CSE
Year / Sem : III / V Date : 18.07.2019 Year / Sem : III / V Date : 18.07.2019
Time: 09.00-09.50 AM Maximum Marks: 30 Time: 09.00-09.50 AM Maximum Marks: 30

PART – A (5 x 2 =10) PART – A (5 x 2 =10)

1. Construct finite automata for the RE (0+1)* 1. Construct finite automata for the RE (0+1)*
2. Construct finite automata for the RE 00(0+11)* 2. Construct finite automata for the RE 00(0+11)*
3. Construct finite automata for the RE (a|b)*abb. 3. Construct finite automata for the RE (a|b)*abb.
4. List out any four algebraic properties of regular expression. 4. List out any four algebraic properties of regular expression.
5. State the equivalence of FA and RE. 5. State the equivalence of FA and RE.
PART – B (2 x 10 =20) PART – B (2 x 10 =20)
6. Determine DFA from the given NFA. 6. Determine DFA from the given NFA.
M=( {q0,q1}, {0,1}, δ , q0, { q1} ) where δ is given by M=( {q0,q1}, {0,1}, δ , q0, { q1} ) where δ is given by
δ(q0,0) = { q0, q1} δ(q0,0) = { q0, q1}
δ(q0,1) = { q1} δ(q0,1) = { q1}
δ(q1,0) = δ(q1,0) =
δ(q1,1) = { q0, q1} δ(q1,1) = { q0, q1}