Professional Documents
Culture Documents
Cs2303 Toc Model
Cs2303 Toc Model
Cs2303 Toc Model
com
Roll. NO
TJ INSTITUTE OF TECHNOLOGY, CHENNAI 600 097. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
MODEL TEST Sub. Code : CS 2303 Sub. Name : Theory of Computation Date : Max. Marks : Duration : Year : 10.10.2011. 100 3 Hours III
What is a finite automaton? Give two examples. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings with 011 as a substring.
3. Prove that if L and M are regular languages then so is LUM. 4. What is meant by equivalent states in DFA?
5.
11 b) i) Let L be a set accepted by a NFA then show that there exists a DFA that accepts L. (8) ii)Let L be a set accepted by an NFA.Then prove that there exists a deterministic finite automaton that accepts L.Is the converse true? Justify your answer.
2
www.rejinpaul.com
(8)
12) a) Find the regular expression for the set of all strings denoted by R 13 from the deterministic finite automata given below: (16)
(OR) b) i) Show that the regular languages are closed under intersectionand reversal.
n2/n
(8) (8)
13) a) i) Let G be a CFG and let a=>w in G. Then show that there is a leftmost derivation of w.
n m n
15 a) Define the universal language and show that it is recursively enumerable but not recursive.