Free University of Bolzano/Bozen
Faculty of Computer Science
Master of Science in Computer Science
Theory of Computing
Lectures A.Y. 2008/2009
Teaching material
[M1] Introduction to Automata Theory, Languages,
and Computation (3rd edition). J.E. Hopcroft, R. Motwani,
J.D. Ullman. Addison Wesley, 2007.
[M2] Lecture Notes for
Theory of Computing. Diego Calvanese. 2008. Available as scanned
pages in pdf.
[M3]
Exercises on Theory of
Computing. Available as scanned pages in pdf.
Lectures
Summary
Week |
Topics |
Tuesday
10:30-12:30 (lecture) |
Tuesday
15:00-17:00 (exercise) |
Wednesday
10:30-12:30 (lecture) |
Extra
(lecture) |
#1 Sep. 29 |
Course introduction
|
Course introduction, basic notions about sets
(Lec 1,2)
|
-- |
Basic notions about relations, functions, languages
(Lec 3,4)
|
|
Details
Week 1:
Course introduction
Lectures 1,2 - 30/9/2008
- Topics
[M2: Part 1]
- course presentation
- basic definitions about sets
- What you should know after the lecture
- the basic definitions regarding functions, relations, and their
properties
Lectures 3,4 - 1/10/2008
- Topics
[M2: Part 1]
- basic definitions about sets, relations, functions
- cardinality of a set, countable and uncountable sets, Cantor's
theorem
- basic definitions about languages
- What you should know after the lecture
- the definition of cardinality of a set
- the difference between countable and uncountable sets
- Cantor's diagonalization argument
- the formal meaning of alphabet, string, language
Course home page
Last modified:
Sunday, 14-Sep-2008 19:31:43 EST