Scribd
Upload
286 views2 pages

Tafl KCS 402 Cia-I 2019-20

The document is a test paper for the course Theory of Automata and Formal Languages. It contains questions assessing various course outcomes related to designing automata like DFAs, NFAs, regular expressions; converting between notations; minimizing DFAs; and properties of regular languages. The test has three parts - Part A contains 5 short answer questions, Part B contains 3 long answer questions out of which student has to answer any 3, and Part C contains 2 long answer questions out of which student has to answer any 1.

Uploaded by

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

Tafl KCS 402 Cia-I 2019-20

The document is a test paper for the course Theory of Automata and Formal Languages. It contains questions assessing various course outcomes related to designing automata like DFAs, NFAs, regular expressions; converting between notations; minimizing DFAs; and properties of regular languages. The test has three parts - Part A contains 5 short answer questions, Part B contains 3 long answer questions out of which student has to answer any 3, and Part C contains 2 long answer questions out of which student has to answer any 1.

Uploaded by

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

Roll No.

JSS MAHAVIDYAPEETHA
JSS ACADEMY OF TECHNICAL EDUCATION, NOIDA
DEPARTMENT OF INFORMATION TECHNOLOGY

CIA-I
AY 2019-20 (EVEN Semester)
Course : B.Tech. Date : 24-02-2020
Semester : IV Subject Code : KCS-301
Subject : Theory of Automata and Formal Languages Max. Marks : 30
Time : 9:30-10:30 AM

COURSE OUTCOMES
211.1 Design deterministic and nondeterministic automata and regular expressions for specified regular
languages
211.2 Convert among various notations for a regular language, such as DFAs, NFAs, and regular
expressions.
211.3 Design grammar and PDA for CFL and state and prove their equivalence.
211.4 Design TM to recognize language and compute functions.
211.5 State and prove properties of regular, context free, recursive and recursive enumerable
languages.
211.6 Explain the significance of the Universal Turing machine, Church-Turing thesis and concept
of Undecidability.

Q. Questions CO BL
No.
PART- A: Attempt All Questions (5x1 = 5 Marks)
1. How many substrings aab are in wwRw, where w = aabbab CO1 3
2. Give the language of the following DFA CO1 3
a b
→p* q r
q r p
r r r
3. Differentiate between DFA and NFA. CO2 2
4. Use extended transition function to show the result of giving string w = 0011 as input CO1 3
to the following finite automata

5. State the Myhill Nerode Theorem. What are its applications? CO5 2

PART-B: Attempt ANY THREE Questions (3x5 = 15 Marks)


6. Construct a DFA to accept set of strings on {0,1} in which, every substring of 3 CO1 4,5
symbols has at most two zeros. (All strings of length <=2 are also in the language)
7. Construct DFA equivalent to the following ε-NFA CO2 3

8. Minimize the following DFA CO2 3

a b
→q1(Final) q3 q2
q2 q4 q1
q3 q5 q4
q4 q4 q4
q5 (Final) q3 q2

9. Design a DFA for accepting binary numbers whose decimal equivalent is divisible by CO1 4,5
5.

PART-C: Attempt ANY ONE Question (1x10 = 10 Marks)


10. a) Give a DFA for the following language over the alphabet Σ = {0, 1}: CO1 4,5
L={ w | w starts with 1 and has odd length, or starts with 0 and has even length }
E.g., strings 1101011, 000101 are in L, while 1011 and 00001 are not in L.
b) Convert the following NFA into a DFA CO2 3
0 1
→q0 q0, q1 q0, q3
q1 q2 -
q2 (Final) - -
q3 - q4
q4 (Final) - -

11. a) Design ε −NFA for the language of strings consisting of either 01 repeated one or CO1 4,5
more times, or 010 repeated one or more times over alphabets Σ = {0, 1}.
b) Construct NFA without ε −transitions equivalent to the ε –NFA constructed above. CO2 3

You might also like