Scribd
Upload
55 views2 pages

PDA Construction Assignment

This document contains an assignment from Krishna Engineering College with 10 questions related to pushdown automata (PDA) and context-free languages (CFL). The questions ask the student to: construct a PDA for a specific language; convert a grammar to a PDA; state the equivalence between PDA and CFL; and justify that PDA are more powerful than finite automata.

Uploaded by

Lakshit
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
55 views2 pages

PDA Construction Assignment

This document contains an assignment from Krishna Engineering College with 10 questions related to pushdown automata (PDA) and context-free languages (CFL). The questions ask the student to: construct a PDA for a specific language; convert a grammar to a PDA; state the equivalence between PDA and CFL; and justify that PDA are more powerful than finite automata.

Uploaded by

Lakshit
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

KRISHNA ENGINEERING COLLEGE

(Approved by AICTE & Affiliated to Dr. APJ Abdul Kalam Technical University (Formerly UPTU), Lucknow)

Department of Computer Science & Engineering


Assignment 4

Date of Assignment: 22 June 2022 Date of submission: 26 June 2022

BL
[Link] , Mark
Question
. C s
O
1 2,4 2

2,4 2
2

2
3

5 5
5

Construct a PDA that accepts the language L over {0, 1} by empty stack which 2
7 accepts all the string of 0's and 1's in which a number of 0's are twice of number of
1's.

Mohan Nagar, Near Air Force Station- Hindon, Ghaziabad – 201007 (U.P.)
Tel: 0120-2657731, 2657732, TeleFax : 0120-2659513
Email: director@[Link], Website : [Link] 1
KRISHNA ENGINEERING COLLEGE
(Approved by AICTE & Affiliated to Dr. APJ Abdul Kalam Technical University (Formerly UPTU), Lucknow)

Department of Computer Science & Engineering


Convert the following grammar to a PDA that accepts the same language. 2
8 1. S → 0S1 | A
2. A → 1A0 | S | ε
9 State the equivalence of PDA and CFL. 5

10 A PDA is more powerful than a finite automaton. Justify this statement. 5

Mohan Nagar, Near Air Force Station- Hindon, Ghaziabad – 201007 (U.P.)
Tel: 0120-2657731, 2657732, TeleFax : 0120-2659513
Email: director@[Link], Website : [Link] 2

You might also like