CS8501 Question Bank Theory Of Computation Regulation 2017

CS8501 Question Bank THEORY OF COMPUTATION

CS8501 Question Bank Theory Of Computation Regulation 2017 Anna University free download. Theory Of Computation Important 8 Mark Questions CS8501 pdf free download.

Sample CS8501 Question Bank Theory Of Computation

Demonstrate how the set L= {abn/n>=1} is not a regular.(13)

Express that the regular languages are closed under:(13)
(a)union (b)intersection(c)Kleene Closure(d)Complement (e)Difference

Examine whether the language L=(0n1n| n>=1) is regular or not? Justify your answer (13) CS8501 Question Bank Theory Of Computation

(i)Describe a Regular Expression. Write a Regular Expression for the set of strings that consists of alternating 0’s and 1’s.(6)
(ii)Construct Finite Automata equivalent to the regular expression (ab+a)*(7).

(i)Describe the closure properties of regular languages.(6)
(ii)Describe NFA with epsilon for the RE=(a/b)*ab and convert it into DFA and further find the minimized DFA.(7)

Demonstrate how the set L= {anbn/n>=0} is not a regular.(13) CS8501 Question Bank Theory Of Computation

Verify the whether L ={ a 2n| n>=1} regular (13)

i) Prove The reverse of a regular language is regular (6)
ii) A homomorphism of regular language is regular (7)

Discuss on regular expressions (13) CS8501 Question Bank Theory Of Computation

Construct NDFA for given RE using Thomson rule. (13)
i) a.(a+b)* ab
ii) (a.b)*
iii) (a+b)

Explain the DFA Minimization algorithm with an example.(13)

i) Prove the L1 and L2 are two languages then L1- L2 is regular (7) CS8501 Question Bank Theory Of Computation
ii) Prove the L1 and L2 are two languages then L1 . L2 is regular (6)

i) Prove the L1 and L2 are two languages then L1 U L2 is regular (7) CS8501 Question Bank Theory Of Computation
ii) Prove the L1 and L2 are two languages then L1 intersection L2 is regular (6)