Annotation

---

The course material presents formal tools, methods and algorithms for modeling the behavior of discrete systems. Theoretical settings and practical examples are explained, which give students basis for presenting discrete objects in the field of software systems. Various tools for recognition of formal languages such as finite automata, Petri nets, Turing machine are represented in the program. During the seminar exercises, basic tasks are solved that demonstrate the presented concepts.

Content

---

• Sets and set operations
• Arrays of character strings
• Regular sets and expressions. Calculations with regular expressions
• Formal languages and formal grammars
• Language recognition by finite automata
• Language recognition using Petri nets
• Turing machines