Say whether each of the following sets is regular (reg), context free but not regular (cf), or not context free (not cf). No proofs necessary. a. {x = {a,b,c,d}* | #a(x) = #b(x) = #c(x) = #d(x)} (where #a(x) is the number of occurrences of the symbol a in string ) b. {aj is a power of 3} c. {x = {0, 1}* | x represents a multiple of 3 in binary} d. L(0*1*0*1*) e. the set of all balanced strings of parentheses of four types ( ) [ ] < > { }) f. {anbm|n 0} j. {a^b™ c² d³ | n = i or m = · j}
Say whether each of the following sets is regular (reg), context free but not regular (cf), or not context free (not cf). No proofs necessary. a. {x = {a,b,c,d}* | #a(x) = #b(x) = #c(x) = #d(x)} (where #a(x) is the number of occurrences of the symbol a in string ) b. {aj is a power of 3} c. {x = {0, 1}* | x represents a multiple of 3 in binary} d. L(0*1*0*1*) e. the set of all balanced strings of parentheses of four types ( ) [ ] < > { }) f. {anbm|n 0} j. {a^b™ c² d³ | n = i or m = · j}
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
![Say whether each of the following sets is regular (reg), context free but not regular (cf), or not context free (not cf). No proofs necessary.
a. {x = {a,b,c,d}* | #a(x) = #b(x) = #c(x) = #d(x)} (where #a(x) is the number of occurrences of the symbol a in string )
b. {aj is a power of 3}
c. {x = {0, 1}* | x represents a multiple of 3 in binary}
d. L(0*1*0*1*)
e. the set of all balanced strings of parentheses of four types ( ) [ ] < > { })
f. {anbm|n<m}
g. {anbmcndmn, m ≥ 0}
h. {anbmcm dnn, m ≥ 0}
i. {anbncm dmn,m > 0}
j. {a^b™ c² d³ | n = i or m =
· j}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8556d69d-021f-41af-8992-a4945764c669%2Fa82e5ea8-112e-42d8-aa48-39ac30e7b5da%2F1uf8l16_processed.png&w=3840&q=75)
Transcribed Image Text:Say whether each of the following sets is regular (reg), context free but not regular (cf), or not context free (not cf). No proofs necessary.
a. {x = {a,b,c,d}* | #a(x) = #b(x) = #c(x) = #d(x)} (where #a(x) is the number of occurrences of the symbol a in string )
b. {aj is a power of 3}
c. {x = {0, 1}* | x represents a multiple of 3 in binary}
d. L(0*1*0*1*)
e. the set of all balanced strings of parentheses of four types ( ) [ ] < > { })
f. {anbm|n<m}
g. {anbmcndmn, m ≥ 0}
h. {anbmcm dnn, m ≥ 0}
i. {anbncm dmn,m > 0}
j. {a^b™ c² d³ | n = i or m =
· j}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education