Note that in questions below na(w) and n,(w) indicate the number of a's and the number of b's in string w. 1. Find a regular expression for the following languages over E= {a,b}" (a) {w : w does not contain substring bbb} (b) {w : w contains exactly three a's and it ends with abb} (c) {w: na(w) mod 3 = 0 and w begins with ab} (d) {w: (na(w) + ns(w)) mod 32 2} (e) {w : |w| mod 2 = 0} (f) L= {a™b" : mn > 4} %3D %3D
Note that in questions below na(w) and n,(w) indicate the number of a's and the number of b's in string w. 1. Find a regular expression for the following languages over E= {a,b}" (a) {w : w does not contain substring bbb} (b) {w : w contains exactly three a's and it ends with abb} (c) {w: na(w) mod 3 = 0 and w begins with ab} (d) {w: (na(w) + ns(w)) mod 32 2} (e) {w : |w| mod 2 = 0} (f) L= {a™b" : mn > 4} %3D %3D
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
Do all of the following questions or as much as possible

Transcribed Image Text:Note that in questions below na(w) and n,(w) indicate the number of a's and the number of b's
in string w.
1. Find a regular expression for the following languages over E= {a,b}"
(a) {w : w does not contain substring bbb}
(b) {w : w contains exactly three a's and it ends with abb}
(c) {w: na(w) mod 3 = 0 and w begins with ab}
(d) {w : (na(w) + no(w)) mod 3 2 2}
(e) {w : |w| mod 2 = 0}
(f) L = {amb" : mn > 4}
2. Find an NFA that accepts the language defined by the following regular expression
ab(a + ab)*(a + aa*) + (abab)* + (aaa* + b)*
3. Find a regular expression for the following regular languages
(a) {w : 2na(w) + 3n,(w) is even}
(b) {w : (na(w) – n,(w)) mod 3 = 1}
4. Find a regular grammar for the following languages
(a) L(aa" (ab+ a)*)
(b) L((aab* ab)*)
(c) L =
{w : (na(w) – ni(w)) mod 3 = 1}
5. Prove that the following langauges are not regular
(a) L = {ww: w E {a,b}*}
(b) L = {a"b* : n 2 k}
(c) L = {a"b* : n+m > k > 0}
(d) L = {w e {a, b}" : 2n.(w) = 3n,(uw)}
%3D
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 3 steps with 3 images

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
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