Mathematical Foundation of Computer Science

(Chris Devlin) #1

10.1 Introduction.....................................................................................................................


10.2 Pumping Lemma for Regular Languages......................................................................


10.3R egular & Nonregular Languages Examples
10.4P roperties of Regular Languages
10.5Decision Problems of Regular Languages
10.5.1 Emptiness Problem
10.5.2 Finiteness problem
10.5.3 Membership Problem
10.5.4 Equivalence Problem
10.5.5 Minimization Problem and Myhill Nerode Theorem (Optimizing DFA)
Exercises


REGULAR AND NONREGULAR


LANGUAGES

Free download pdf