Back to All Events

State Machines in Information Technology


Study program: F6 Information Systems and Technologies

Degree: Master

Type of module: lectures, practical work

Lecturer: Assoc. Prof., PhD Natalii Khatsko

Language: English

Credit Points: 5 ECTS

Description:
The aim of the discipline is to obtain the theoretical foundations of the theory of finite automata, the formation of students' practical knowledge and skills necessary for the application of mathematical methods in the design of software systems. Acquiring practical skills in forming the characteristics of a software system using finite automates, using formal methods and models to describe the behavior of software systems, and the ability to create a mathematical model of a software application based on the theory of finite automates.
1. Introduction to the theory of formal proofs
2. Alphabets, grammars and languages
3. Regular expressions, languages.
4. Deterministic finite automata
5. Non-deterministic finite automata
6. Finite automata with epsilon transitions
7. Languages and regular expressions
8. Finite automata and regular expressions
9. Two algorithms for converting a finite automaton into a regular expression
10. Transformation of a regular expression into a finite automaton

Previous
Previous
1 September

Data Processing by Means of Python

Next
Next
1 September

Basic of microsensors