Scribd
Upload
120 views2 pages

TAFL Question Paper

This document outlines the structure and content of a sessional test for B. Tech students in their second year, specifically for the subject TAFL. It includes details such as the exam date, duration, total marks, and learning outcomes related to automata theory and formal languages. The test consists of three sections with various questions requiring the design of automata, proofs of theorems, and grammar analysis.

Uploaded by

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

TAFL Question Paper

This document outlines the structure and content of a sessional test for B. Tech students in their second year, specifically for the subject TAFL. It includes details such as the exam date, duration, total marks, and learning outcomes related to automata theory and formal languages. The test consists of three sections with various questions requiring the design of automata, proofs of theorems, and grammar analysis.

Uploaded by

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

(Following Subject Code and Roll no.

to be filled in your Answer Book)


SUBJECT CODE:KCS 402 Roll no. : ______________________________

B. Tech: IInd Year


Sessional Test-I (Even Semester: 2021-22)
SEMESTER: IV BRANCH: CSE SECTIONS: A, B & C
Subject Name : TAFL
Date of Examination : 30-05-22
Time: 90 mins Total Marks: 50
Note: Do as Directed. Missing data if any may be suitably assumed and mentioned. Symbols have their usual
meaning.
CO1: Acquire an understanding of the core concept of automata theory & formal languages.
CO2:An ability to design grammars and automata for different language classes.
CO3:Identify formal language classes and prove language and membership properties.

SECTION-A
Attempt ALL parts. All parts carry EQUAL marks. [2*5=10]

1. Design a DFA that accepts odd zeros and odd ones. (CO1)
2.Design a FA over alphabet ∑={0,1}, which accepts the set of strings either start with 01 or end with 01.
(CO1)
3.State and Prove Arden’s Theorem. (CO2)
4.Prove that (1+00*1)+(1+00*1)(0+10*1)*(0+10*1)=0*1(0+10*1)* (CO2)
5.What string (Language) will be generated by the grammar: S→aSbS/bSaS/€ (CO3)

SECTION-B
Attempt ALL questions from this section. Internal [5*4=20]

1.Obtain the DFA with minimum number of states which accepts the same language which is acceptable by
following DFA. (CO1)

State /∑ a b

q0 q2 q0

q1 q0 q2

q2 q3 q1

q3* q3 q1

q4 q3 q5

q5 q4 q4

q6 q5 q6

q7 q3 q3
2. Convert following Mealy to Moore machine: (CO1)

3. Draw the finite automata for the following expression 1(1+10)*11+(00+11)*. Convert that FA into NFA
without null-moves. (C02)

4. Find the regular expression corresponding to the following Finite Automata using Arden’s Theorem: (C02)

SECTION-C
Attempt ALL questions from this section. Internal Choices are indicated. [10*2=20]

1 Find a regular expression corresponding to each of the following subsets [0,1] (CO1)
a.) Language of all strings containing at-least 2 zeros.
b.) Language of all strings containing at most 2 zeros.
c.) Language of all strings ending with 01.
d.) Language of all strings ending with 1 and doesn’t contain 00

2 For the grammar G having productionsE→E+E/E*E/ (E)/id Find the followings: (CO3)

a.) Leftmost order of derivation for (id+id)*(id+id)


b.) Rightmost order of derivation for id*id+id
c.) Derivation trees for both above
d.) Check whether it’s an ambiguous grammar

*******************************************************************

You might also like