Question: Consider the language F = {a i b j c k | i, j, k 0 and if i = 1 then j = k}.

Consider the language F = {aibjck | i, j, k 0 and if i = 1 then j = k}.

a. Show that F is not regular

b. Show that F acts like a regular language in the pumping lemma. In other words, give a pump length p and demonstrate that F satisfies the three conditions of the pumping lemme for this value of p.

c. Explain why parts a and b don't contradict pumping lemma.

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!