Scribd
Upload
135 views3 pages

FLAT Assignment 2

This document contains an assignment for a Formal Language and Automata Theory course. It includes 7 questions related to formal languages, automata theory and computability. The questions assess various concepts like constructing PDAs and Turing machines for specific languages, explaining properties of Turing machines and the halting problem, applying pumping lemmas and grammars, and converting between models like Mealy and Moore machines. The assignment is worth 20 marks and is due on October 20th for the 5th semester B.Tech CSE course at College of Engineering, Landran, Mohali.

Uploaded by

Prathamesh Pandey
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
135 views3 pages

FLAT Assignment 2

This document contains an assignment for a Formal Language and Automata Theory course. It includes 7 questions related to formal languages, automata theory and computability. The questions assess various concepts like constructing PDAs and Turing machines for specific languages, explaining properties of Turing machines and the halting problem, applying pumping lemmas and grammars, and converting between models like Mealy and Moore machines. The assignment is worth 20 marks and is due on October 20th for the 5th semester B.Tech CSE course at College of Engineering, Landran, Mohali.

Uploaded by

Prathamesh Pandey
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/ 3

CGC- College of Engineering, Landran, Mohali

Department of Computer Science and Engineering

Assignment-2
B. TECH (CSE) – 5th SEMESTER
Subject Name- Formal Language & Automata Theory Date of Assignment: - 13/10/2023
Subject Code: - BTCS 502-18 Date of Submission: - 20/10/2023
M. Marks -20
Course Outcomes
CO1 Recognize formal notation for strings, languages and machines.
CO2 Classify finite automata to accept a set of strings of a language.
CO3 Design context free grammars to generate strings of context free language.
Determine equivalence of languages accepted by Push Down Automata and language generated by context free grammars.
CO4
Comparison between computability and non-computability and Decidability and undecidability.
CO5

S.No Questions Relev


. ance
Marks Bloom’s
to
Distribution Level
CO
No.
1. Construct a PDA equivalent to the following Language (1+1.5)=2.5 CO4 L2
L= { 0n1n | n ≥ 0 } and L = {wcw’ | w={0, 1}*} where w’ is the reverse of Marks
w.
2. Explain the basics of a Turing Machine and explain its tuples. Design a (1.5+1)=2.5 CO5 L3
Turing machine with no more than three states that accept the language a Marks
(a+b)*. Assume ∑ = {a, b} and Construct a Turing Machine for L = {a^n
b^n | n>=1}

3. When we say a problem is decidable? Give an example of an un- (.5*3+1)=2.5 CO5 L4


decidable problem. State the halting problem of TMs. Prove that the Marks
halting problem of Turing Machine over {0, 1}* as unsolvable.

4. State the pumping lemma for CFLs. Is the language L= {anbncn | n>=1} is (1+1.5)=2.5 CO3 L5
context-free? Justify. Marks
5. a) What does Church Turing Thesis state? (1+2)=3 CO6 L1
b) State Cook- Levin Theorem and Universality of Cellular Automata. Marks
6. Construct the following grammar into GNF (Greibach normal form). 3 Marks CO3 L2
S—AA/0
A—SS/1
Construct a Mealy machine equivalent to the Moore Machine defined by 4 Marks CO6 L5
7. the following.

Subject Coordinator IQAC Coordinator HOD

You might also like