Course detail

Modern Theoretical Computer Science

FIT-TIDAcad. year: 2010/2011

Not applicable.

Language of instruction

Czech

Number of ECTS credits

0

Mode of study

Not applicable.

Guarantor

prof. RNDr. Alexandr Meduna, CSc.

Department

Department of Information Systems (UIFS)

Learning outcomes of the course unit

Not applicable.

Prerequisites

Not applicable.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Not applicable.

Assesment methods and criteria linked to learning outcomes

Not applicable.

Course curriculum

Not applicable.

Work placements

Not applicable.

Aims

Not applicable.

Specification of controlled education, way of implementation and compensation for absences

Not applicable.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic 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

Recommended reading

  • 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

Classification of course in study plans

  • Programme VTI-DR-4 Doctoral

    branch DVI4 , any year of study, winter semester, elective

  • Programme VTI-DR-4 Doctoral

    branch DVI4 , any year of study, winter semester, elective

Type of course unit

 

Lecture

39 hours, optionally

Teacher / Lecturer

prof. RNDr. Alexandr Meduna, CSc.

Syllabus

  • 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.

Project

13 hours, optionally

Teacher / Lecturer

prof. RNDr. Alexandr Meduna, CSc.