Dicrete Structures

Weekly classes 2+2+0
Control form Exam


The content concerns tools for modeling the behavior of discrete systems. Theoretical statements and practical examples are presented, providing the students a suitable basis for presentation and modeling of discrete objects in the field of software. The program includes various language recognition tools such as finite automata, Petri nets, Turing machine. During the seminar exercises, basic tasks are solved to demonstrate the concepts set out.


Main issues of the syllabus content:

  • Sets and operations with sets. String sets. Regular sets and expressions.
  • Formal languages and grammars
  • Language recognition by Petri terminals and marked networks
  • Turing machines