Scribd
Upload
27 views1 page

FLAT Assignment-02 - 2024

Uploaded by

ashutoshpatrogenai
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
27 views1 page

FLAT Assignment-02 - 2024

Uploaded by

ashutoshpatrogenai
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/ 1

Computer Science & Engineering

www.nist.edu NIST Institute of Science & Technology (AUTONOMOUS)


(Approved by AICTE, New Delhi, Affiliated to BPUT: Rourkela)
INSTITUTE PARK, PALLUR HILLS, BERHAMPUR, ODISHA -761 008

ASSIGNMENT NO # 02
Sub- Course: Formal Language and Automata Theory() Due Date – 05 /12 /2024
Program: B.Tech, 5th Semester (Batch-2022) Full Mark-- 100

Answer all Questions. Each Question Carries 5 Mark


QNo. CO* Level BTL: (1) Remembering (2) Understanding (3) Applying (4) Analyzing (5) Evaluating (6) Creating

A) S→aA | bB , A→aAA | bS | b , B→bBB | aS | ∈


Convert the following context free grammar to Chomsky’s Normal Form (CNF):
1 3 2
B) S -> ABA , A->aA|∈, B->bB|∈
Check whether the string “ababaa” is a member of given CFG using CYK algorithm.
S→AB|BC
2 3 2 A →BA|a
B →CC|b
C →AB|a

3 3 3 Design a PDA for the language L={anbmcmdn | n,m>=1}

4 4 3 Design a Turing Machine to accept the language L= {WcW | W ∈ {0,1}*}

5 3 2 Describe Chomsky Hierarchy of Languages

6 3 3 Prove that L={0m| m is a prime number} is not a Context Free Language

7 4 3 Explain about pumping lemma for context-free language.

Write short notes:


a. Class NP-Complete
8 4 2 b. Decidability
c. Church-Turning Thesis
What do you mean by the Turing Machine Halting Problem? Shows that the Halting Problem
9 4 2 of the Turing Machine is Undecidable.
Design a Turing Machine to compute m+n as it is shown for the given input and respective
output.

10 4 3

*CO3: Understand and design PDA to recognize CFLs and TM to recognize Unrestricted Languages.
*CO4: Understand Formal Language Classes, concepts computability, and decidability of problems using TM and their complexity classes.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy