Problems
EECS2001E Problem Set Tutorial 4: May 31, 2019
In addition we will discuss the pumping lemma and its application to show some languages are not regular. Try to understand solutions to Examples 1.73, 1.74, and 1.75 of Sipser, Second edition.
Only logged in customers who have purchased this product may leave a review.
Reviews
There are no reviews yet.