Question: Question ( 2 ) - prove that the following languages over the alphabet { a , b , c } are not regular using pumping

Question (2)- prove that the following languages over the alphabet {a, b, c} are not regular using pumping lemma:
1. Language L={a power m,b power r, c power msuch that m>=0,r>=0}
2. Language L ={ww power r such that w in {a+b+c}}
Notes:
i. R means a reversed string. ii. Use pumping length of 4.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!

Q:

Problem 1: Properties and Relations of Regular Languages [10] In each of the following statements, A and B denote languages. For each statement, identify a counter-example to prove that it is false....

Q:

Homework 2 Problem 1. (5 points) Given two NFA's M and M2, show how you will con- struct an NFA M such that L(M)=L(M) n L(M2). Problem 2. (15 points) For each of the following languages over the...

Q:

Automata Theory Question While solving these, can you mention what needs to be done step by step to solve such questions? Thank you in advance. Regular Expressions Provide a regular expression for...

Q:

Determine whether language is regular using pumping lemma. The alphabet is E = {a,b,c,d} Is the below language L regular or nonregular? If L is regular give a regular expression that denotes it. If L...

Q:

Determine whether language is regular using pumping lemma. The alphabet is = = {a,b,c,d} Is the below language L regular or nonregular? If Lis regular give a regular expression that denotes it. If L...

Q:

2. Pumping Lemma for Regular Languages (30 pts.) Prove that the following language is not regular using pumping lemma. Remember to closely follow the format shown in class. L1 = {xBx | x {a, b} },...

Q:

Solve these question Question No 1: Consider the following languages to prove that the given languages are not regular using pumping lemma: Note: Solution should include all three cases for each...

Q:

Question 5: Prove that the following languages are not regular. 4. fa"b" : m 2 0,n 2 0, m n). (Using the Pumping Lemma for this one is a bit tricky You can avoid using the Pumping Lemma by combining...

Q:

4. Consider the language L consisting of binary strings with the same number of O's and ls. (a) Prove that L is not regular using pumping lemma. (b) Prove that L is not regular using the closure...

Q:

Pumping Lemma question 5. (10 points) Is L regular? Either prove that it is not regular using pumping lemma, or describe an RE for it. L = {0nw0n I n 21, w is a string over alphabet {0, 1))

Q:

Gill Corporation needs to set a target price for its newly designed product M14-M16. The following data relate to this new product. These costs are based on a budgeted volume of 80,000 units produced...

Q:

Examine the following sample data for the variables y and x: a. Construct a scatter plot of these data. Describe the relationship between x and y. b. Calculate the sum of squares error for the...

Q:

Using GDS , how would nonresidential real property in the US placed in service on or after May 1 3 , 1 9 9 3 , be depreciated

Q:

please help with understanding the steps to this problem ! thank you ! Sikes Hardware is adding a new product line that will require an investment of $1,512.000 Managers at that the investment will...