a. Given a grammar G =(V.T.E.P) over set of alphabets = (0....9, +. . (. ) with productions . E ->I E ->E + E E ->E E E -> (E) | -> E|0|11... 19 and derive String (9+8) (6+4) b. Languages are given as, L1 = (ab" In>=0}. L2%= L(ab"), L3=D{a,ab,abb,abbb....}, L4= (X IX is over (a,b}.begins with a, followed by any number of b. Prove that L1=L2=L3=L4

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
a. Given a grammar G =(V.T,E.P) over set of alphabets = {0,...,9, +. . (. } with productions.
E ->I
E ->E +E
E ->E* E
E -> (E)
|-> E|0|11... 19
and derive String (9+8)*(6+4)
b. Languages are given as , L1 = {ab"" In>=0}, L2= L(ab"). L3=(a,ab,abb,abbb....}. L4= {(X |X is over {a,b},begins with a, followed by
any number of b.
Prove that L1=L2=L3=L4
Transcribed Image Text:a. Given a grammar G =(V.T,E.P) over set of alphabets = {0,...,9, +. . (. } with productions. E ->I E ->E +E E ->E* E E -> (E) |-> E|0|11... 19 and derive String (9+8)*(6+4) b. Languages are given as , L1 = {ab"" In>=0}, L2= L(ab"). L3=(a,ab,abb,abbb....}. L4= {(X |X is over {a,b},begins with a, followed by any number of b. Prove that L1=L2=L3=L4
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Sorting
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.
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