Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Show that the language F={a^ib^jc^k|i,j,k >=0 and if i = 1 then j=k} is not regular. Show, however, that it satisfies the statement of the
Show that the language F={a^ib^jc^k|i,j,k >=0 and if i = 1 then j=k} is not regular. Show, however, that it satisfies the statement of the pumping lemma as I proved it in class,i.e. there is a p such that all three conditions for the pumping lemma are met. Explain why this doesnt contradict the pumping lemma.
Question 3[20 points] Show that the language F = {aiBekli, j, k > 0 and ifi1 then j k } is not regular. Show, however, that it satisfies the statement of the pumping lemma as I proved it in class, i.e. there is a p such that all three conditions for the pumping lemma are met. Explain why this does not contradict the pumping lemma Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started