Use the pumping lemma to show that the following languages are not regular (c) (5 pts)...

Use the pumping lemma to show that the following languages are not regular

(c) (5 pts) Let Σ = {0, 1, −, =} and

SUB = {x = y − z | x, y, z are binary integers, and x is the result of the subtraction of z from y}. For example: 1 = 1 − 0, 10 = 11 − 01 are strings in SUB but not 1 = 1 − 1 or 11 = 11 − 10.

Expert Solution

Any queries just comment

Give thumbsup

Thank you and all the best

venereology answered 1 year ago

Use the pumping lemma to show that the following languages are not regular. A a. A1={0^n...

Use the pumping lemma to show that the following languages are not regular. A a. A1={0^n 1^n 2^n | n≥0} b. A2 = {www | w ∈ {a,b}∗} A c. A3 ={a^2^n | n≥0} (Here, a^2^n means a string of 2^n a’s.) A ={a3n |n > 0 }

1. Pumping Lemma: a. Is the following language a regular language? (Use pumping lemma in proof.)...

1. Pumping Lemma: a. Is the following language a regular language? (Use pumping lemma in proof.) L = {0n 1n 2n | n ≥ 0} b. What is (i.e., define) the CFL pumping lemma?

Do not use Pumping Lemma for Regular Expression to prove the following. You may think of...

Do not use Pumping Lemma for Regular Expression to prove the following. You may think of Closure Properties of Regular Languages 1. Fix an alphabet. For any string w with |w| ≥ 2, let middle(w) be the string obtained by removing the first and last symbols of w. That is, Given L, a regular language on Σ, prove that f1(L) is regular, where f1(L) = {w : middle(w) ∈ L}

let sigma = {a,b,c}. Use the Pumping Lemma to show that the language L defined below...

let sigma = {a,b,c}. Use the Pumping Lemma to show that the language L defined below is not regular. L={ a^p c(bb)^q : q > p >1}

Prove that {anbamba2m+n:n,m≥1} is not regular using pumping lemma

Show that L2 = {anb2nan : n ≥ 0} is not context-free using the pumping lemma.

Determine whether or not the following languages are regular. If the language is regular then give...

Determine whether or not the following languages are regular. If the language is regular then give an NFA or regular expression for the language. Otherwise, use the pumping lemma for regular languages or closure properties to prove the language is not regular. 1) L = { 0 n1 k : k ≤ n ≤ 2k} 2) L = { 0 n1 k : n > 0, k > 0 } È { 1 k0 n : k > 0, n...

Are the following languages over {a, b} regular? If they are then prove it. If they...

Are the following languages over {a, b} regular? If they are then prove it. If they are not prove it with the Pumping Lemma a) {ap | p is a prime number} b) {xax | x Î{a,b}*} (start by listing some strings in, not in, the language

Formal Languages Give a regular expression for each of the following languages: L2a = {w ?...

Formal Languages Give a regular expression for each of the following languages: L2a = {w ? {0,1}* | w corresponds to the binary encoding of non-negative integers that are evenly divisible by 4 L2b = {w ? {a,b}* | w contains at least one 'a' and exactly two b's} L2c = {w ? {0, 1, 2}* | w starts with a 2, ends with a 1 and contains an even number of 0's}.

Use Myhill-Nerode Theorem to prove the following languages are not regular A1 = {0n1n2n| n >=...

Use Myhill-Nerode Theorem to prove the following languages are not regular A1 = {0n1n2n| n >= 0} A2 = {www| w E {a, b}*}

Question