Scribd
Upload
31 views2 pages

Formal Language & Automata

Uploaded by

ashishsinghji1212
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views2 pages

Formal Language & Automata

Uploaded by

ashishsinghji1212
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Institute of Engineering and TechnologY

Dr. Shakuntala Misra National Rehabilitation University, Lucknow


1 Sessional examination 2022 - 23
Course Name: - B.Tech. Semester: - 5n
Paper Name : - Formal Languages and Automata Theory Paper Code: -TCS - 505
Time - 1Hrs + 15 minutes per hour extra time for V.l. &examinees with writer. Max Marks - 20
saoH 3j6 - 20

Instructions:
The question paper consists of three sections namely A, B,C. All sections are compulsory.
Section -A Each question carries 1 marks. All questions are compulsory.
Section -B Answer any 5out of 6 given questions in maximum hundred ( 50) words. Each question
carries 2 marks.
Section -C Answer any 1out of 2given questions in maximum onehundred fifty ( 150 ) words. Each
question carries 5 marks.

Section -A(qug - )
Objective Questions(dgHA)
1 Answer all the following questions. 5 x1-5

I) The basic limitation of finite automata is that


a) It can't remember arbitrary large amount of information.
b)It sometimes recognize grammar that are not regular.
c) It sometimes fails to recognize regular grammar.
d) Allof the mentioned
I|) Number of final state require to accept in minimal finite automata.
a) 1
b) 2
c) 3
d) None of the mentioned
) Which of the following options is correct?
Statement 1: Initial State of NFA is Initial State of DFA.
Statement 2: The final state of DFA will be every combination of final state of NFA.
a) Statement 1 is true and Statement 2 is true
b) Statement 1 is true and Statement 2 is false
c)Statement 1 can be true and Statement 2 is true
d) Statement 1 is false and Statement 2 is also false
IV) Which of thefollowing is not a regular expression?
a) [(a +b)-(aa +bb )]"
b) ((0+1) -(0b +al) (a+b) |"
c) (01+ 11 + 10 )"
d)( 1+2+0 )(1+2 )*
V) How many strings of length less than 4 contains the language described by the regular expression
(x+y)y(a+ab )*?
a) 7
b) 10
c) 12
d) 11
Page 1 of 2
Section -B(ug- )
Short Answer Questions ( GISTyHH )
2. Answer any five of the following questions in maximum 50 words. 5x2=10
Afafi 5 Ì Sr AeodH 50
1. Define Finite Automata.
2 Explain Determinism and
3 Explain Kleene Closure andNon-Determinism.
Positive Closure. What is
4 Define Dead State, Equal State and Unreachable State.complement of a language.
5. Explain [ -closure
6. Construct an NFA that accepts all strings over(0,1} with an even number of 0s or
an odd number of 1s.

Section -C(Tug H)
Descriptive Questions (aEKUIIGHAYTT)
3. Answer any 01 question of the following question in
maximum 150 words 1x5 =5

1, (a) Explain Pumping Lemma for


Regular
(b) Design Minimal DFA over (a, b}suchLanguages.
that it accepts all strings with atleast one a' and
"b's exactly two
2 (a) Define Regular Expression. What is the
expressions? advantage of Regular Expression. what are primitive regular
Ifr=(a + b),L(r) =?
(b)Construct a Moore Machine that takes set
of all
output if the string is starting and ending with the String over (a, b} as input and produce result '1,' as
same symbol, otherwise produce'0 'as output.

b4

Page 2 of 2

You might also like