Course details
Modern Theoretical Computer Science
Guarantor
Language of instruction
Czech, English
Completion
Examination
Time span
- 39 hrs lectures
- 13 hrs projects
Department
Study literature
- Kopie přednášek
- Meduna, A.: Automata and Languages. London, Springer, 2000
- John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to Autotmata Theory, Boston, Addison-Wesley, 2001
Fundamental literature
- John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to Automata Theory, Boston, Addison-Wesley, 2001
- mnoho nejnovějších článků, vědeckých zpráv a knih
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.
Course inclusion in study plans