Theory Computation Sep Oct 2022
Theory Computation Sep Oct 2022
Theory Computation Sep Oct 2022
ECTION _ A
Answer any ten questions. Each question carries two marks. (10x2=20)
b,E
4. Construct a repular expression for the hnguage consisting of all strings of a's
and b's beginning with 'a'and ending with 'ab'.
o. Obtain a grammar to generate the set of all strings wlth exactly one a, over
I
= {a, b}.
P.T.O"
uG - 420 I ilil fliltil tilt lltil il]t tilt ilil
2*.
t
12. Write the meaning of the regular expression 0* 1*
. $ECTION -B
-Answer any five questions. Each question carries marks.
s (5x5=25)
13. Check whether the strings "a a bab" and "baba" are accepted by the following
DFA (Deterministic Finite Automata).
b
14. Design a DFA that accepts stringl of a's and b's having a substring ,,aa,,.
17. Design a grammar to generate the language L = lanbnln > 0, m > n).
ItIIlIillilililililillfllililrfl uG - 420
18. Eliminate the useless symbols in the follow-ing grammar :
S-+AB
A-+a
B -+ blC
E-+d
19. Explain the types of turing machines.
20. Construct the PDA for the grammar S -+ aSbbla.
(PDA : Push Down'Automata).
SECTION _ C
22. Find a DFA equivalent to the following NFA N = ({go, q1, q2}, {a, b}, 6,q0,{qe})
where 6 is defined as
24- a) obtain a TMto accept a string w of a,s and b's such that
u(w) is equal
N
to Nb(w).
7
(TM : Turing Machine)
b) state and prove pumping remma for regurar language. I
25. convert the given grammar to chomsky Normal Form (cNF).
15
S + ABICA
B -+ BCIAB
A+a
C -+ aBlb
SECTION _ D I
Answer any one of the foilowing questions. Each carries 10 marks. (1x10=10)
26. Minimize the following Deterministic Finite Automata (DFA).
10