Q5. Do only parts b) and c). Exercise 6.2.1: Design a PDA to accept each of the following languages. You may accept either by final state or by empty stack, whichever is more convenient. * a) {0n 1n n ≥ 1}. We shall accept by empty stack. Symbol X will be used to count the 0's on the input. In state q, the start state, where we have seen no l's, we add an X to the stack for each 0 seen. The first X replaces Zo, the start symbol. When we see a 1, we go to state p, and then only pop the stack, one X for each input 1. Formally, the PDA is ({q, p}, {0,1}, {X, Zo}, 8, q, Zo). The rules: 8(q, 0, Zo) = {(q, X)} 8(q,0, X) = {(q, XX)} 8(q, 1, X) = {(p,ɛ)} 8(p, 1, X) = {(p,ɛ)} b) The set of all strings of 0's and 1 's such that no prefix has more l 's than 0's. c) The set of all strings of 0's and 1 's with a n equal number of 0's and I's.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Q5.
Do only parts b) and c).
Exercise 6.2.1: Design a PDA to accept each of the following languages. You may accept either
by final state or by empty stack, whichever is more convenient.
* a) {0n 1n n ≥ 1}.
We shall accept by empty stack. Symbol X will be used to count the 0's on the input. In state q,
the start state, where we have seen no l's, we add an X to the stack for each 0 seen. The first X
replaces Zo, the start symbol. When we see a 1, we go to state p, and then only pop the stack, one
X for each input 1. Formally, the PDA is ({q, p}, {0,1}, {X, Zo}, 6, q, Zo). The rules:
8(q, 0, Zo) = {(q, X)}
8(q, 0, X) = {(q, XX)}
8(q, 1, X) = {(p, ε)}
8(p, 1, X) = {(p, ε)}
b) The set of all strings of 0's and 1 's such that no prefix has more l 's than 0's.
c) The set of all strings of 0's and 1 's with a n equal number of 0's and I's.
Transcribed Image Text:Q5. Do only parts b) and c). Exercise 6.2.1: Design a PDA to accept each of the following languages. You may accept either by final state or by empty stack, whichever is more convenient. * a) {0n 1n n ≥ 1}. We shall accept by empty stack. Symbol X will be used to count the 0's on the input. In state q, the start state, where we have seen no l's, we add an X to the stack for each 0 seen. The first X replaces Zo, the start symbol. When we see a 1, we go to state p, and then only pop the stack, one X for each input 1. Formally, the PDA is ({q, p}, {0,1}, {X, Zo}, 6, q, Zo). The rules: 8(q, 0, Zo) = {(q, X)} 8(q, 0, X) = {(q, XX)} 8(q, 1, X) = {(p, ε)} 8(p, 1, X) = {(p, ε)} b) The set of all strings of 0's and 1 's such that no prefix has more l 's than 0's. c) The set of all strings of 0's and 1 's with a n equal number of 0's and I's.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Stack
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education