Question: Use pumping lemma to prove the language below is regular or not regular (P.S. Even if its regular can you prove it by using pumping

Use pumping lemma to prove the language below is regular or not regular

(P.S. Even if its regular can you prove it by using pumping lemma I need to show possibilities that it is indeed regular)

A = {w|w = (101)^n, n>2}

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 Databases Questions!

Q:

Prove whether the following is a regular language or not. If the language is regular, give a NFA, or use pumping lemma to prove the language is not regular L = {a n^2 | n 1}.

Q:

4 ( a ) . Consider language L = { b a n b a n | n > 0 } over alphabet = { a , b } . Using Pumping Lemma prove that this language is not regular. ( b ) Using result of ( a ) prove that language B = {...

Q:

Using the Pumping Lemma to prove the language, , is not context - free, = { | n is a prime number } ( PLEASE use the following template to do the proof. ) [ ANSWER ] Statement I want to prove: Fill...

Q:

( VI ) In using Pumping Lemma, we prove that L is not regular by Proof of Contradiction. i . e , Assume L be a regular language and there exists an integer m ( # of states of DFA ) . What are the...

Q:

1. (10 points) a. Use Pumping Lemma to prove that DOUBLE(Eo"1 I n 20]) is nonregular. b. Explain the problem in the following attempted proof that STUTTEREO"I" | n 20)) is nonregular: "Proof": In...

Q:

1. Derive the string bbaa using right most derivations and hence show that the following grammar is ambiguous. Also, draw the derivation trees for the given grammar. B - BB | Ba 2. Construct the...

Q:

1. Derive the string 0011 using right most derivations and hence show that the following grammar is ambiguous. Also, draw the derivation trees for the given grammar. A - AAI E | OA1 2. Construct the...

Q:

use pumping lemma to prove if it is finite, it is a regular language 1. Prove L {a"(baa)m:n 20, m 1} is regular using three different methods. Justify your answers

Q:

Let L be the set of words w E {a,b)" where the parity of the number of a's in w is the opposite of the parity of number of b's in w. Questions 1-3 pertain to this language L 1. Find a regular...

Q:

Problem 1 : Let \ ( \ mathrm { i } , \ mathrm { j } , \ mathrm { k } \ ) be positive integers. The alphabet for all the languages is \ ( \ { 0 , 1 \ } \ ) . a ) Prove that the language that is...

Q:

What is the shape of a monopolists demand curve and marginal revenue curve?

Q:

Saturated (liquid + vapor) ammonia at 60C is contained in a rigid steel tank. It is used in an experiment, where it should pass through the critical point when the system is heated. What should the...

Q:

On April L . year 1 , Mary borrowed $ 2 0 0 , 0 0 0 to reficance the orfginal mongage on her principal revidence. Mary peld 3 points to ned rabe from 6 percent to 5 percent. The loan is for a 3 0 -...

Q:

On 1 March 2007 DB Limited issued R560 000 15% debentures at R98. The debentures were to be redeemed at par in four equal annual payments starting 28 February 2010. Required: Journalise the above...