Question: Let = {0, 1}. Consider the language A = {w | w = 0i10j where i < j and |w| is odd}. Suppose you are

Let = {0, 1}. Consider the language A = {w | w = 0i10j where i < j and |w| is odd}. Suppose you are asked to prove that the language A is not regular, what would be the string s that has length at least p that you want to use. Note that you do not have to actually prove it. Just give me a string s.

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!