[Modules]
[Syllabus]
Module #4: Properties of Regular Languages
Objectives
- Prove a language is or is not regular
- Show closure properties
- Create a fa for a regular language
- Create the regular expression for the language of a fa
Topics
- Closure properties of regular languages
- Pumping Lemma
- 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:
Properties of Regular Languages
4. Busch, Shiri & Grahne:
Non-regular Languages
Old Homeworks
Homework Fall 05
[PDF]
Solutions
[PDF]
Homework Summer 05
[PDF]
Solutions
[DOC] [PDF]
Homework
Homework
[PDF]
Homework Solutions [DOC]
[PDF]
Exam #1 Solutions
[pdf]
Use this tool
to check regular expressions and automata
Check out pumping lemma
stuff.