Scribd
Upload
29 views17 pages

Model Paper Tafl (Bcs 402)

This document is a model paper for the Theory of Automata and Formal Languages course (BCS402) for B. Tech 2nd Year at Northern India Institute of Technology, Lucknow, for the academic session 2024-25. It includes various sections with questions covering topics such as regular expressions, Mealy and Moore machines, Turing machines, and automata theory. The paper consists of multiple-choice questions, short answer questions, and problems to solve, with a total of 70 marks available.

Uploaded by

deveshdk008
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
29 views17 pages

Model Paper Tafl (Bcs 402)

This document is a model paper for the Theory of Automata and Formal Languages course (BCS402) for B. Tech 2nd Year at Northern India Institute of Technology, Lucknow, for the academic session 2024-25. It includes various sections with questions covering topics such as regular expressions, Mealy and Moore machines, Turing machines, and automata theory. The paper consists of multiple-choice questions, short answer questions, and problems to solve, with a total of 70 marks available.

Uploaded by

deveshdk008
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/ 17

BABUBANARASIDAS

NORTHERN INDIA INSTITUTE OF TECHNOLOGY,LUCKNOW


B. TECH.2ndYEAR–MODEL PAPER
ACADEMIC SESSION 2024-25(EVEN SEMESTER)

Theory of Automata and Formal Languages(BCS402)


Time:3hrs MaxMarks:70
NOTE:Attemptallsections
SECTIONA
Q01.Attempt ALL questions in brief: (02*7=14)

1A (CO1, 2 MARKS, K3)

SOLUTION
1B (CO2, 2 MARKS 2, K3)
Give an regular expression for representing the set L of strings in which every 0 is
immediately followed by at least two 1 s.
Solution

1C (CO2, 2 MARKS 2, K3)

Solution

1D (CO3, 2 MARKS 2, K3)

Solution
1E (CO3, MARKS 2, K3)

Solution

1F Pushdown automata model is suitable for which language and type (CO4, MARKS 2, K2)

Solution
Context free grammar and type 2.

1G Describe turing machine model (CO5, MARKS 2, K2)


Solution
SECTION B
Q.02 Attempts any three of the following (03*7=21)

2A Define mealy machine and moore machine (CO1, MARKS 7, K3)


Solution:

2B (CO2, MARKS 7, K3)

Solution
2C (CO3, MARKS 7, K3)

Solution
2D (CO4, MARKS 7, K3)

Solution
2E (CO5, MARKS 7, K3)

Solution

SECTION C
Q.03 Attempt any one of the following (01*7=7)
3A (CO1, MARKS 7, K3)
Solution

3B (CO1, MARKS 7, K4)


Construct a mimmum state automaton equivalent to an automaton whose transition table is defined by Table

Solution
Q.04 Attempt any one of the following (01*7=7)

4A (CO2, MARKS 7, K3)

Solution
4B (CO2, MARKS 7, K3)

State and prove Ardens Theorem


Solution

Q.05 Attempt any one of the following (01*7=7)

5A (CO3, MARKS 7, K3)

Solution
5B (CO3, MARKS 7, K3)

Solution
Q.06 Attempt any one of the following (01*7=7)

6A (CO4, MARKS 7, K3)

Solution

6B (CO4, MARKS 7, K3)

Solution
Q.07 Attempt any one of the following (01*7=7)

7A (CO5, MARKS 7, K3)

Solution
7B (CO5, MARKS 7, K3)

Solution

You might also like