4) Consider the language L = L₁ L2, where L₁ = {ww: w = {a, b}* and L2 = {a”b*a": n≥ 0}. a) List the first four strings in the lexicographic enumeration of L? b) Write a context-free grammar to generate L. c) Show a natural PDA for L. (In other words, don't just build it from the grammar using one of the two-state constructions presented in this chapter.) d) Prove that L is not regular. 1) Build a PDA to accept each of the following languages L: a) BalDelim = {w where w is a string of delimiters: (, ), [, ], {, }, that are properly balanced}. b) {ab2i3j + 1}. c) {w = {a, b}* : #a(w) = 2•#b(w)}. d) {a"b" m≤n≤2m}. e) {w = {a, b}* w = w²}. f) {abci,j, k ≥ 0 and (i #j orj #k)}. g) {we {a, b}* : every prefix of w has at least as many a's as b's}. h) {aba" n, m ≥ 0 and m is even}.
4) Consider the language L = L₁ L2, where L₁ = {ww: w = {a, b}* and L2 = {a”b*a": n≥ 0}. a) List the first four strings in the lexicographic enumeration of L? b) Write a context-free grammar to generate L. c) Show a natural PDA for L. (In other words, don't just build it from the grammar using one of the two-state constructions presented in this chapter.) d) Prove that L is not regular. 1) Build a PDA to accept each of the following languages L: a) BalDelim = {w where w is a string of delimiters: (, ), [, ], {, }, that are properly balanced}. b) {ab2i3j + 1}. c) {w = {a, b}* : #a(w) = 2•#b(w)}. d) {a"b" m≤n≤2m}. e) {w = {a, b}* w = w²}. f) {abci,j, k ≥ 0 and (i #j orj #k)}. g) {we {a, b}* : every prefix of w has at least as many a's as b's}. h) {aba" n, m ≥ 0 and m is even}.
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
Related questions
Question
![4) Consider the language L = L₁ L2, where L₁ = {ww: w = {a, b}* and L2 = {a”b*a": n≥ 0}.
a)
List the first four strings in the lexicographic enumeration of L?
b) Write a context-free grammar to generate L.
c) Show a natural PDA for L. (In other words, don't just build it from the grammar using one of the two-state
constructions presented in this chapter.)
d) Prove that L is not regular.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F36fd9238-414f-4e5e-b00a-4398e187562f%2F55d25734-3d6f-413e-97a3-d98dcfd5d151%2Fsorjgb4_processed.png&w=3840&q=75)
Transcribed Image Text:4) Consider the language L = L₁ L2, where L₁ = {ww: w = {a, b}* and L2 = {a”b*a": n≥ 0}.
a)
List the first four strings in the lexicographic enumeration of L?
b) Write a context-free grammar to generate L.
c) Show a natural PDA for L. (In other words, don't just build it from the grammar using one of the two-state
constructions presented in this chapter.)
d) Prove that L is not regular.
![1) Build a PDA to accept each of the following languages L:
a)
BalDelim = {w where w is a string of delimiters: (, ), [, ], {, }, that are properly balanced}.
b) {ab2i3j + 1}.
c) {w = {a, b}* : #a(w) = 2•#b(w)}.
d) {a"b" m≤n≤2m}.
e)
{w = {a, b}* w = w²}.
f) {abci,j, k ≥ 0 and (i #j orj #k)}.
g) {we {a, b}* : every prefix of w has at least as many a's as b's}.
h) {aba" n, m ≥ 0 and m is even}.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F36fd9238-414f-4e5e-b00a-4398e187562f%2F55d25734-3d6f-413e-97a3-d98dcfd5d151%2F8emikfs_processed.png&w=3840&q=75)
Transcribed Image Text:1) Build a PDA to accept each of the following languages L:
a)
BalDelim = {w where w is a string of delimiters: (, ), [, ], {, }, that are properly balanced}.
b) {ab2i3j + 1}.
c) {w = {a, b}* : #a(w) = 2•#b(w)}.
d) {a"b" m≤n≤2m}.
e)
{w = {a, b}* w = w²}.
f) {abci,j, k ≥ 0 and (i #j orj #k)}.
g) {we {a, b}* : every prefix of w has at least as many a's as b's}.
h) {aba" n, m ≥ 0 and m is even}.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Similar questions
Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education