B.

Tech (CS) VI Sem

(Sec-A &B)
Theory Of Computation (TOC)
First Continuous Assessment , Feb- 2020

Date of issue: 4th Feb 2020 Last Date of Submission :10th Feb2020
M.M.=10
Note: Attempt any Four questions.
Q1. Use mathematical induction to prove the following formula
nn  12n  1
Sn = 12 + 22 + 32 + 42 + . . . + n2 =
6
Q2. Define Kleene’s Theorem.Construct NFA - ^ for the following RE using Kleene’s Theorem
(00+1)(101)*
Q3. Prove that for every NFA there exists a DFA which simulates the behavior of NFA.

Q4. Define regular expressions ? Explain any two algebraic laws from the following for regular
expressions:-

(i ) Associativity & Commutativity (iii) Distributive Law

(ii ) Identities and Annihilators (iv) Idempotent Law

Q5. Prove or disprove the following regular expression r and s :-

(i) (r+s)*=r*+s*
(ii) (r+s)*=(r*s*)*