You get a bonus - 1 coin for daily activity. Now you have 1 coin

Finite state machine theory

All lectures: All lectures on the discipline: finite state machine theory are collected here. These fascinating lectures provide us with the opportunity to explore the deep principles and phenomena underlying our knowledge and our desire to understand the world.


1. 2.3. Boolean functions and their presentation forms Truth Table. SDNF and SKNF Matrix Carnot Examples
2. 2.4 Minimizing Boolean Functions
3. 3. Formal logic 3.1. Expression calculus
4. 3.2. Predicates and Quantifiers
5. 4. Counts 4.1. The origin of the graphs
6. 4.2. Basic definitions of graph theory
7. 4.3. Methods for graph representation in analytical form
8. 4.4. Paths and contours in graphs
9. 4.5 Trees as a connected graph
10. five . State machines 5.1. Concept of automaton
11. 5.2. State Machine Representation
12. 5.3. Types of finite automata
13. 5.4. Equivalence of finite automata: Moore's theorem
14. 5.5. Minimization of state machines
15. 5.6. Minimization of incomplete state machines
16. 5.7. Examples of finite automata
17. 5.8. Simulation of automatic systems with Petri nets
18. 6. Algorithms and Turing Machines 6.1. Concept of algorithm
19. 6.2. Basic requirements for algorithms
20. 6.3. Flowcharts
21. 6.4. Formalization of the algorithm concept
22. 6.5. Turing Machine
23. 6.6. Examples of Turing machines
24. Automaton Theory- INTRODUCTION
25. 1. Sets 1.1. Basic concepts of set theory
26. 1.2. Operations on sets. Euler Circles
27. 2. Boole Logic 2.1. Boolean functions