Dept. of Computer Science
CSCI 402/502: Introduction to Theory of Computation Instructor: Pranava K. Jha
Fall 2007
Handouts
How To Prove IT (Dana Angluin)
Applying Pumping Lemma for Regular Languages: Some Examples
An Example of a Non-regular Language that Satisfies the Pumping Lemma(From the Lecture Notes of Dr. Giora Slutzki, Iowa State University)
Proving the Correctness of a Context-free Grammar: Some Examples
Applying Pumping Lemma for Context-free Languages: Some Examples