Do all of the following questions or as much as possible Note that in questions below na(w) and n,(w) indicate the number of a's and the number of b'sin 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 expressionab(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

NOTE: As per rules we are allowed to solve the first 3 subquestion. a. {w: w does not contain…

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

See similar textbooks

Similar questions

8. Build a DPDA that accepts the language L = {(ab)" (aab)b² n ≥0
For each of the following languages L, give a regular expression that represents L and draw or describe a DFA that recognizes L. You do not need to justify your answers. (a) All strings in {0,1}* that do not contain either 100 or 011 as a substring (b) All strings in {0, 1,2}* that do not contain either 01 or 12 or 20 as a substring
1. For each of the following regular expressions find a language (i.e., a set of strings over A = {a,b.c} that can be represented/described by that expression. a. a'bc + bc* b. b'aaac а. b.
13. Show that the language L = {a" : n > 0, n # 4} is regular.
Show the language L = {a"b*c": n > 0, k > 0} is not regular.
Design DPDA to accept language L= {xe [a, b]* N (x) > N,(x)). N(x) > N,(x) means number of a's are greater than number of b's in string x
Prove that the following language is not context-free: L = {w#t|w_is a substring of t, where w,t E {a, b}*}.
Let E= {a, b}. Given regular expressions r = a*b*, r' = ba(ab)* + ab*ba* and r" = (a + b)aa(a + b)*, find L(r), L(r'), and L(r"), the languages defined by r, r', r", respectively.
Use the Pumping Lemma to show the following language L is NOT regular. L= {w E (a, b, c}* ; where w has equal number of a's, b's, and c's}
5. Prove that the following language is not regular: L8 = {a"bmamb" | n 2 0, m > 1}.
I need help to construct a dpda for the language {w in {a,b}^*| w has an unequal amount of a and b}
Create a PDA that accepts the language L = {w ∈ {a.b}* : na(v) ≥ nb(v), where v is any prefix of w}