Scribd
Upload
49 views3 pages

Pcc-Cse 502 (New)

This document contains an exam paper for the subject Formal Language & Automata Theory. It has two groups of questions - Group A contains 6 questions of 5 marks each and Group B contains 7 questions of 10 marks each. Students need to answer any 4 questions from Group A and any 5 questions from Group B. They need to send their answer script to the provided email ID. The paper tests students' knowledge of topics like finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, decidability, and more. It contains questions on converting between automata models, constructing machines for languages, parsing, and proving properties about formal languages and computability.

Uploaded by

Madhumay Kanti Bhattacharjee
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
49 views3 pages

Pcc-Cse 502 (New)

This document contains an exam paper for the subject Formal Language & Automata Theory. It has two groups of questions - Group A contains 6 questions of 5 marks each and Group B contains 7 questions of 10 marks each. Students need to answer any 4 questions from Group A and any 5 questions from Group B. They need to send their answer script to the provided email ID. The paper tests students' knowledge of topics like finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, decidability, and more. It contains questions on converting between automata models, constructing machines for languages, parsing, and proving properties about formal languages and computability.

Uploaded by

Madhumay Kanti Bhattacharjee
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/ 3

BE-V/New/PCC-CSE502/R/2020-21/UIT/BU

B.E Odd Semester (5th) Examinations 2020-21

Subject: Formal Language & Automata Theory


Code: PCC-CSE 502 (NEW)
Time: 3 Hours Full Marks: 70

Instructions: Answer any four questions from Group A (Q. No. 1 to 6)


and any five questions from Group B (Q. No. 7 to 13).

Send this answer script to the mail id [email protected]

Q.NO. QUESTIONS MARKS

Group A
4X5=20
(Answer any four questions from Q. No. 1 to 6)

1. Convert the following Mealy machine into its equivalent Moore machine: 5

2. Construct a regular expression for the following DFA: 5

3. Write a CFG, which accepts the language L, where: 5


L = {0i 1j 0k | j > i + k}.

Using this grammar, show the derivation of the string „0111100‟.

4. Design a PDA to accept the following language by null store:


5
L = {canbm | n,m ≥1}

(Note: Here n and m are unrelated.)

Semester: V Year: 2020-21 Subject Code: PCC-CSE 502(NEW)


BE-V/New/PCC-CSE502/R/2020-21/UIT/BU

B.E Odd Semester (5th) Examinations 2020-21

Subject: Formal Language & Automata Theory


Code: PCC-CSE 502 (NEW)
Time: 3 Hours Full Marks: 70

Instructions: Answer any four questions from Group A (Q. No. 1 to 6)


and any five questions from Group B (Q. No. 7 to 13).

Send this answer script to the mail id [email protected]

Q.NO. QUESTIONS MARKS

𝑛
5. Construct a Turing Machine M to compute 𝑘=1 𝑘 for a given positive integer n. 5

6. Explain how a recursively enumerable language can be reduced to a non-empty 5


language L, which is a proper subset of ∑*.

Group B
5X10=50
(Answer any five questions from Q. No. 7 to 13)

7. Consider the following NFA with ϵ-transitions. Assume „p‟ to be the initial state and 10
„r‟ as the final state.

Compute the ϵ-closure of each state and list all the strings of length three or less
accepted by the automata. Also convert the automaton to its equivalent DFA.

8. (a) Is the following language regular? Justify. 5+5=10

L = {0p 1p pp + q | p ≥ 1, q ≥ 1}

(b) Construct an NFA (Q, ∑, ∂, q0, F) for the following regular expression:

01[((10)+ + 111)* + 0]* 1

Semester: V Year: 2020-21 Subject Code: PCC-CSE 502(NEW)


BE-V/New/PCC-CSE502/R/2020-21/UIT/BU

B.E Odd Semester (5th) Examinations 2020-21

Subject: Formal Language & Automata Theory


Code: PCC-CSE 502 (NEW)
Time: 3 Hours Full Marks: 70

Instructions: Answer any four questions from Group A (Q. No. 1 to 6)


and any five questions from Group B (Q. No. 7 to 13).

Send this answer script to the mail id [email protected]

Q.NO. QUESTIONS MARKS


i^2
9. (a) Using pumping lemma, show that the language L = { 0 | i ≥ 1} is not a CFL. 5+5=10

(b) Convert the following CFG into Greibach Normal Form (GNF):
S → AB | 0
A → BX | 1
B → CD | 2
C → AD | 0
D→1

10. Design a top-down parser to implement the following CFG and parse the string 10
“0102313010”.
S → 0S0 | 1S1 | A
A → 2B3
B → 23 | 31

11. Construct a Post Machine M over {0,1} such that L(M) = {0 n1n0n | n ≥ 1}. Show 10
diagrammatically the correspondence between a Turing Machine and a Post
Machine.

12. Design a Turing Machine M to convert a binary-coded decimal number into a unary 10
number. Validate the design for “1001” and “0000”.

13. Prove or disprove the following theorem statements in the context of Decision 2X5=10
Problems and/or Undecidability:

(i) The halting problem of a Turing Machine is undecidable.

(ii) The membership problem in CFG is undecidable.

Semester: V Year: 2020-21 Subject Code: PCC-CSE 502(NEW)

You might also like