| Title: | Modern Theoretical Computer Science |
|---|
| Code: | TID |
|---|
| Ac.Year: | 2005/2006 |
|---|
| Term: | Winter |
|---|
| Study plans: | |
|---|
| Language: | Czech |
|---|
| Public info: | http://www.fit.vutbr.cz/study/courses/TID/public/ |
|---|
| Completion: | examination (verbal) |
|---|
Type of
instruction: | | Hour/sem | Lectures | Sem. Exercises | Lab. exercises | Comp. exercises | Other |
|---|
| Hours: | 39 | 0 | 0 | 0 | 13 |
|---|
| | Examination | Tests | Exercises | Laboratories | Other |
|---|
| Points: | 60 | 0 | 0 | 0 | 40 |
|---|
|
|---|
| Guarantee: | Meduna Alexander, prof. RNDr., CSc., DIFS |
|---|
| Lecturer: | Meduna Alexander, prof. RNDr., CSc., DIFS |
|---|
| Faculty: | Faculty of Information Technology BUT |
|---|
| Department: | Department of Information Systems FIT BUT |
|---|
| Prerequisites: | |
|---|
| | | Learning objectives: |
|---|
In-depth overview of modern theoretical computer science. | | Description: |
|---|
This course discusses advanced topics of theoretical computer science.
It concentrates on the very recent research in the area of automata,
formal languages, formal models, computability, complexity, and
translation. The relation between theoretical computer science and
mathematics is explained in detail. Philosophical aspects of
theoretical computer science are discussed as well. | | Knowledge and skills required for the course: |
|---|
formal languages | | Learning outcomes and competences: |
|---|
Thorough grasp of concepts and results achieved in modern theoretical computer science. | | Syllabus of lectures: |
|---|
- Introduction.
- Pure formal models.
- Regulated formal models; matrix and programmed rewriting.
- Parallel formal models; L systems; semi-parallel formal models; scattered rewriting.
- Universal formal systems; selective rewriting; grammar systems.
- Formal models for natural languages.
- Algbraic approach to automata; relations and translations.
- Algbraic approach to formal languages; free monoids.
- More on the relationship between mathematics and computer science; graphs, categories.
- New approach to complexity and computability.
- Theoretical computer science and philosophy; Russell, Wittgenstein, Godel, Carnap, Husserl, Marcel, Heidegger.
- Crucial trends introduced during the last decade.
- Expected future trends; summary.
| | Syllabus - others, projects and individual work of students: |
|---|
- An essay based on selected scientific studies dealing with the
teoretical computer science area related to the student's dissertation
| | Fundamental literature: |
|---|
- John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to Autotmata Theory, Boston, Addison-Wesley, 2001
- many very recent papers, scientific reports and books
| | Study literature: |
|---|
- copy of lectures
- Meduna, A.: Automata and Languages. London, Springer, 2000
- John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to Autotmata Theory, Boston, Addison-Wesley, 2001
| | Controlled instruction: |
|---|
several papers | | |
|
Faculty of Information Technology