Using pumping lemma, prove that the language L = {aibjck | j=i+k} is not regular.

  • Answered by oriattic
  • 0 Comments
  • 8 months ago

This answer is restricted. Please login to view the answer of this question.

Login Now
Leave your Answer:

Click here to submit your answer.

s
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments