CSCI 301 — Math Exercises # 5 (Solution)

$ 19.99
Category:

Description

YOUR NAME HERE
Use the pumping lemma to prove that each of the following languages is not regular.
1. {aibj | i ≥ j ≥ 0}
2. {aibjck | i = j or j = k}
1

Reviews

There are no reviews yet.

Be the first to review “CSCI 301 — Math Exercises # 5 (Solution)”

Your email address will not be published. Required fields are marked *