5. Prove that the following languages are not regular: (a) L = {a"bak-k < n+1). (b)...
just need to answer (e , f , g ) 5. Prove that the following languages are not regular (a) L = {a"bak : k-n +1). (b) L = {a"bak : k n +1). (c) L = {an blak : n = l or l k} Chapter 4 Propertics of Regular Lauge Chapter 4 Properties of Regular Languages (d) L = {anl/ : n > 1). (e) L= {w: na(w)メnb (w)). (f) L = {ww : w E {a,b)').
Prove that each of the following languages is not regular A) L= {a^n b^m c^k : k = 2n + 3m and n, m, k ≥ 0} B) L = {a^n : n is a power of 5}
Show that the following languages are not regular. Parts(b) and (c) 5. Prove that the following languages are not regular: (a) L = {amb’ak: k sn +1}. (b) L = {a” b'ak : kun +1}. (c) L = {a"b'ak: n=1 or 1 # k}.
Prove that the following languages are not regular. You may use the pumping lemma and the closure of the class of regular languages under union, intersection, and compliment. a){} b){} c) { is not a palindrome} *d)} 0"1"0" m,n>0
Let S = {a, b}. Show that the language L = {w EX : na(w)<n(w) } is not regular.
1. (Non-regular languages) Prove that the following languages are not regular. You may use the pumping lemma and the closure of the class of regular languages under union, intersection, complement, and reverse (b) L2 = { w | w ∈ {0, 1}* is not a palindrome }. A palindrome is a string that reads the same forward and backward
Consider the following languages over the binary alphabet {a, b}: L:={a^nb^m:n≥m} Answer if it is regular or not, and prove it, and explain.
Use the pumping lemma for context-free languages to prove that L3 is not a CFL. L3 = { w: w e{a,b,c}* and na(w) < nh(w) < nc(w) }.
disprove that the given lan 4. [20 Points For each of the following languages, prove or guage is regular (a) L1www e {a,b}*} {w w E {a, b}* and no two b's in w have odd number of a's in between}. (b) L2 (c) L3 a" (d) L4 vw n = 3k, for k > 0}. a, b}*} disprove that the given lan 4. [20 Points For each of the following languages, prove or guage is regular (a) L1www e...
HW03 - 1 to 4 Problem 1 Find a regular expression for the set ^a"bm: (n + m) is odd Problem 2 Give regular expressions for the following languages. 3. The complement of L 4. The complement of L2 Problem 3 Find a regular expression for L = {w: na(w) and nb(w) are both even } Problem 4 Find dfa's that accept the following languages A. L-L(ab a)UL((ab) ba)