Key Learning objectives
At the completion of the course, all students should have the ability to:
- Determine a language's location in the hierarchy: regular languages, context-free languages, and recursively enumerable languages.
- Prove that a language is in a specified class.
- Convert among DFAs, NFAs, and regular expressions.
- Explain the Church-Turing Thesis and its significance.
- For certain languages, prove that they are not recursively enumerable.
Prof. Bob Sloan, January 13, 2009
