15453 Formal Languages, Automata, and Computation
Lecture 7: Nonregular Languages
So far we have seen three characterizations of regular languages:
via DFAs, via NFAs and via regular expressions. In this lecture we
analyze how to prove that languages are not regular. The
central property of regular languages we take advantage of for
this purpose is expressed in the pumping lemma.
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
