The operation Perm(w), applied to a string w, is all strings that can be constructed by permuting the symbols of w in any order. For example, if w = 101, then Perm(w) is all strings with two l's and one 0, i.e., Perm(w) = {101, 110, 011). If L is a regular language, then Perm(L) is the union of Perm(w) taken over all w in L. For example, if L is the language L(0*1*), then Perm(L) is all strings of 0's and 1's, i.e., L((0+1)*). If L is regular, Perm(L) is sometimes regular, sometimes context-free but not regular, and sometimes not even context-free. Consider each of the following regular expressions R below, and decide whether Perm(L(R)) is regular, context- free, or neither: 1. (01)* 2.0*+1* 3. (012)* 4. (01+2)* a) Perm(L(0*+1*)) is context-free but not regular. Ob) Perm(L((01+2)*)) is context-free but not regular. Oc) Perm(L((01+2)*)) is not context-free. d) Perm(L((01)*)) is regular.
The operation Perm(w), applied to a string w, is all strings that can be constructed by permuting the symbols of w in any order. For example, if w = 101, then Perm(w) is all strings with two l's and one 0, i.e., Perm(w) = {101, 110, 011). If L is a regular language, then Perm(L) is the union of Perm(w) taken over all w in L. For example, if L is the language L(0*1*), then Perm(L) is all strings of 0's and 1's, i.e., L((0+1)*). If L is regular, Perm(L) is sometimes regular, sometimes context-free but not regular, and sometimes not even context-free. Consider each of the following regular expressions R below, and decide whether Perm(L(R)) is regular, context- free, or neither: 1. (01)* 2.0*+1* 3. (012)* 4. (01+2)* a) Perm(L(0*+1*)) is context-free but not regular. Ob) Perm(L((01+2)*)) is context-free but not regular. Oc) Perm(L((01+2)*)) is not context-free. d) Perm(L((01)*)) is regular.
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
![The operation Perm(w), applied to a string w, is all strings that can be
constructed by permuting the symbols of w in any order. For example, if w=
101, then Perm(w) is all strings with two l's and one 0, i.e., Perm(w) = {101,
110, 011). If L is a regular language, then Perm(L) is the union of Perm(w) taken
over all w in L. For example, if L is the language L(0*1*), then Perm(L) is all
strings of 0's and 1's, i.e., L((0+1)*).
If L is regular, Perm(L) is sometimes regular, sometimes context-free but not
regular, and sometimes not even context-free. Consider each of the following
regular expressions R below, and decide whether Perm(L(R)) is regular, context-
free, or neither:
1. (01)*
2.0*+1*
3. (012)*
4. (01+2)*
a) Perm(L(0*+1*)) is context-free but not regular.
O b) Perm(L((01+2)*)) is context-free but not regular.
c) Perm(L((01+2)*)) is not context-free.
O d) Perm(L((01)*)) is regular.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fafe426b9-ef8c-4a96-8d4d-dfbbb2450597%2F84d8d47b-8373-4a54-b59f-9e7260d06918%2F3x25ixd_processed.jpeg&w=3840&q=75)
Transcribed Image Text:The operation Perm(w), applied to a string w, is all strings that can be
constructed by permuting the symbols of w in any order. For example, if w=
101, then Perm(w) is all strings with two l's and one 0, i.e., Perm(w) = {101,
110, 011). If L is a regular language, then Perm(L) is the union of Perm(w) taken
over all w in L. For example, if L is the language L(0*1*), then Perm(L) is all
strings of 0's and 1's, i.e., L((0+1)*).
If L is regular, Perm(L) is sometimes regular, sometimes context-free but not
regular, and sometimes not even context-free. Consider each of the following
regular expressions R below, and decide whether Perm(L(R)) is regular, context-
free, or neither:
1. (01)*
2.0*+1*
3. (012)*
4. (01+2)*
a) Perm(L(0*+1*)) is context-free but not regular.
O b) Perm(L((01+2)*)) is context-free but not regular.
c) Perm(L((01+2)*)) is not context-free.
O d) Perm(L((01)*)) is regular.
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 3 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
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](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