Unit-1

Theory of Computation
CIC-206
GGSIPU Previous year questions

Feb 2015

Q1) What is the difference between strings and words of language .Explain with example.

Q2) Differentiate between Kleen closure and positive closure with suitable example

Q3) Define regular language .What is the difference between (a,b) and (a+b)

Q4) Draw the NFA that accept the language a*+(ab)*

Q5) Design a FA that accept all binary strings where 0’s and 1’s alternate

Q6) Convert the following NFA to DFA.In the figure ,A is start state and B is final State.

Q7) What is the significance of Mealy and Moore machine in computing

Q8) How pumping lemma can be applied to prove that certain sets are not regular

Q9) Is L={a2n/n>1 } regular ? Explain

Q 10) (a) Determine the regular expression for the given DFA using the Arden theorem

A
1,0

Q11) Define the Chomsky classification

Q 12) State and prove Arden theorem

May 2015

Q13) Give regular expression for the following

(A) L1:Set of all strings of 0 and 1 ending in 00

 (B) L2: Set of all strings of 0 and 1 beginning with 0 and ending with1

Q14) Construct a minimal DFA that can be derived from the following regular expression
0*(01)(0/111)*

Q15) Explain Mealy and Moore machine in brief

Feb 2016

Q16) Define the following terms with examples

(a) Input Alphabet

(b) Automata
(c) Language
(d) Grammar

Q17) Differentiate between Deterministic Finite automata and Non deterministic Finite Automata

Q18) Construct a regular expression from the given FA(where P is final state ) by using Arden
theorem

Q19) Draw a DFA for the regular expression aa*/bb*.

Q20) Explain Mealy and Moore machine with example

Q21) Define regular expression .Explain the four characteristics that are used to simplify the regular
expression

Q22) State the pumping lemma for regular grammar

May 2016

Q23) Differentiate between DFA and NFA

Q24) Differentiate between Moore and Mealy Machine

Q25) Briefly explain Chomsky classification of languages with examples

Q26) Draw a DFA for all strings over (0,1) consisting of even no of 0’s and even no of 1’s.

Q27) State and prove pumping lemma for Regular languages .Also prove that language L={anbn for
n=1,2,3-----------} is not regular

Q28) Find a regular expression corresponding to each of the following subset {0,1}
 (a) The language of all strings containing atleast two 0’s
(b) The language of all strings containing atmost two 0’s

Feb 2017

Q29) Define Automata and differentiate between DFA and NDFA.

Q30) Differentiate between Mealy and Moore Machine .Design a mealy machine to find the 1’s
complement of given binary number.

Q31)Represent the following set by regular expression {12n+1|n>0}and describe in English

language,the set represented by the following regular expression a(a+b)*b

Q32) Find all the strings of length 4 or less in the regular set represented by the following regular
expression (a*b+b*a)*

Q33) Draw the finite automata

(10+01)*0(001+011)*

Q34) Minimize the following DFA M=({ q0,q1,q2,q3,q4,q5,q6},{a,b},delta,q0,{q6}) where delta is

given by

State a b

qo q0 q3

q1 q2 q5

q2 q3 q4

q3 q0 q5

q4 q0 q6

q5 q1 q4

q6 q1 q3

Q 35) Design a DFA for the following regular expression P=(00)*(11)*.Afterwards convert that DFA in
a way (a) It would accept complement of a given regular expression (p) (b) It would accept reverse of
given regular expression (pr)

Q36) Prove that L={ap |P is Prime number} is not regular

May -June 2017

Q37) Explain deterministic and non deterministic automata with example

Q38) State and Prove Pumping lemma for languages

Q39) Design a minimum state automata for the following DFA

Q40) Prove that (1) a*(ab)*(a*(ab)*(a*(ab)*)*=(a+ab)*

(2) (1+00*1)+(1+00*1)(0+10*1)*(0+10)*1)=(0+10*1)*

Q41) Convert the following Moore machine to its equivalent Mealy Machine

Feb 2018

Q42) Write down the regular expression for the following diagram

Q43) Design a Mealy machine to find the 2’s complement of given binary number which is processed
from right to left instead of left to right

Q44) Design a DFA accepting the binary equivalent of the elements of the set {2n|n>0} and describe
in English language the following regular expression (a)*b(a)*b(a)*b(a)*

Q45) Find all the strings of length 4 or less in the regular set represented by the following regular
expression (ba*+ab*) and design a DFA for the regular expression (00)*(11)*
Q46)Minimize the following DFA =({q0,q1,q2,q3,q4,q5,{a,b},delta ,q0,{q0,q5}) where delta
is given as δ(q0,a)=q0, δ(q0,b)=q3, δ(q1,a)=q2, δ(q1,b)=q5, δ(q2,a)=q3, δ(q2,b)=q4,
δ(q3,a)=q0, δ(q3,b)=q5, δ(q4,a)=q0, δ(q4,b)=q5, δ(q5,a)=q1, δ(q5,b)=q4

Q47) Design a DFA for the regular expression P=(1+01)*.Afterwards convert that DFA in such
a way it accepts complement and reverse of given expression
Q48) Prove that L={0N1N|N>=0}is not regular.

May-June 2018
Q48) What is finite automata .Differentiate between DFA and NFA
Q49) Construct a DFA over the alphabet {0,1},such that the number of 0’s in the string is
always even
Q50) State and prove Kleen’s theorem
Q51) Construct a Mealy machine which is equivalent to Moore Machine

Q52) Minimize the following DFA here states are p,q,r,s,t

Q53) Construct a DFA equivalent to NFA M whose transition table is given in table 2

Feb 2019
Q54) Define NFA with the help of an example
Q55) Construct a DFA to accept all strings over{0,1} which contain three consecutive zeros
Q56) Minimize the following DFA
Q57)

Q58) Construct the regular expression for the DFA shown below

May 2019
Q59) Construct a Mealy machine equivalent to Moore Machine given in table

Q60) Describe the Chomsky classification of language with example

Q61) Minimize the following DFA
Q 62) Prove that for any input string x and y, δ(q,xy)= δ(δ(q,x),y) where δ is the transition
function of DFA
Q63) Draw the DFA for regular expression 00*11(11)*00* and find the complement and
reverse of DFA
Q64) Draw the DFA for L={anbm |n,m>=1} and if L is not regular language then prove it using
pumping lemma