Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

ANURADHA ENGINEERING COLLEGE, CHIKHLI

Department: Computer Sci. & Engg. Semester: IV Th SEM


Subject : TOC Subject Code: 4KS05
Time : 1:30hrs Max. Marks: 30
Q.1 (a) Explain various operation performed on string with example? 07
(b) Explain DFA? Design for the set of all strings ending with b over = {a,b}. 08

OR
Q.2 (a) Explain NFA? Design NFA for the language L= all strings over {0,1} that have at
least two consecutive 0’s or 1’s. 07
(b) Convert following Mealy Machine to Moory Mchine 08

Q.3 (a) Explain in brief properties of CFLs. 08


(b) Design a PDA for accepting a Language L = {0 n 12n , n>0} 07

Q.4 (a) Design a PDA for accepting a Language L = {a n bm cn : m, n ≥1} 08


(b) Design a PDA for accepting a Language L = {a m bm cn : m, n ≥1} 07

ANURADHA ENGINEERING COLLEGE, CHIKHLI


Department: Computer Sci. & Engg. Semester: IV Th SEM
Subject : TOC Subject Code: 4KS05
Time : 1:30hrs Max. Marks: 30
Q.1 (a) Explain various operation performed on string with example? 07
(b) Explain DFA? Design for the set of all strings ending with b over = {a,b}. 08

OR
Q.2 (a) Explain NFA? Design NFA for the language L= all strings over {0,1} that have at
least two consecutive 0’s or 1’s. 07
(b) Convert following Mealy Machine to Moory Mchine 08

Q.3 (a) Explain in brief properties of CFLs. 08


(b) Design a PDA for accepting a Language L = {0 n 12n , n>0} 07

Q.4 (a) Design a PDA for accepting a Language L = {a n bm cn : m, n ≥1} 08


(b) Design a PDA for accepting a Language L = {am bm cn : m, n ≥1} 07

You might also like