Module #4: Properties of Regular Languages

Objectives

1. Prove a language is or is not regular
   
2. Show closure properties
   
3. Create a fa for a regular language
   
4. Create the regular expression for the language of a fa
   

Topics

1. Closure properties of regular languages
   
2. Pumping Lemma
   
3. Equivalence of regular expressions and finite automata

Background Material

0. Texts 0. Texts

Sudkamp: Sections 6.1-6-6.

1. Wikepedia: Pumping Lemma
2. Grahne Text Slides: Pages 89-132
3. Busch, Shiri & Grahne: Finite Automata
4. Busch, Shiri & Grahne: Finite Automata
5. Video of equivalence of nfa's and dfa's [vPOD]
6. Video of equivalence of finite automata and regular expressions [vPOD]
7. Video of decidability [vPOD]
8. Video of Pumping Lemma [vPOD]

Old Homeworks

Homework Summer 05 [PDF]
Solutions [DOC] [PDF]