By ΠΠ΅Π»ΠΎΡΡΠΎΠ² Π.Π., Π’ΠΊΠ°ΡΠ΅Π² Π‘.Π.
ΠΠ΅Π»ΠΎΡΡΠΎΠ² Π.Π., Π’ΠΊΠ°ΡΠ΅Π² Π‘.Π., 2025
ΠΠ°Π½Π½ΡΠΉ ΡΡΠ΅Π±Π½ΠΈΠΊ, Π²Ρ ΠΎΠ΄ΡΡΠΈΠΉ Π² ΡΠ΅ΡΠΈΡ Β«ΠΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ° Π² ΡΠ΅Ρ Π½ΠΈΡΠ΅ΡΠΊΠΎΠΌ ΡΠ½ΠΈΠ²Π΅ΡΡΠΈΡΠ΅ΡΠ΅Β», ΠΎΡ Π²Π°ΡΡΠ²Π°Π΅Ρ ΠΊΠ»ΡΡΠ΅Π²ΡΠ΅ ΡΠ°Π·Π΄Π΅Π»Ρ Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΠΎΠΉ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠΈ. Π Π½Π΅ΠΌ ΠΈΠ·Π»ΠΎΠΆΠ΅Π½Ρ ΠΎΡΠ½ΠΎΠ²Ρ ΡΠ΅ΠΎΡΠΈΠΈ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ² ΠΈ ΠΎΡΠ½ΠΎΡΠ΅Π½ΠΈΠΉ, ΡΠ»Π΅ΠΌΠ΅Π½ΡΡ Π°Π±ΡΡΡΠ°ΠΊΡΠ½ΠΎΠΉ Π°Π»Π³Π΅Π±ΡΡ, ΡΠ΅ΠΎΡΠΈΡ Π³ΡΠ°ΡΠΎΠ², Π° ΡΠ°ΠΊΠΆΠ΅ ΠΊΠ»Π°ΡΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΏΠΎΠ½ΡΡΠΈΡ ΡΠ΅ΠΎΡΠΈΠΈ Π±ΡΠ»Π΅Π²ΡΡ ΡΡΠ½ΠΊΡΠΈΠΉ. ΠΡΠΎΠ±ΠΎΠ΅ Π²Π½ΠΈΠΌΠ°Π½ΠΈΠ΅ ΡΠ΄Π΅Π»Π΅Π½ΠΎ ΠΎΡΠ½ΠΎΠ²Π°ΠΌ ΡΠ΅ΠΎΡΠΈΠΈ ΡΠΎΡΠΌΠ°Π»ΡΠ½ΡΡ ΡΠ·ΡΠΊΠΎΠ², Π²ΠΊΠ»ΡΡΠ°Ρ ΠΊΠΎΠ½Π΅ΡΠ½ΡΠ΅ Π°Π²ΡΠΎΠΌΠ°ΡΡ, ΡΠ΅Π³ΡΠ»ΡΡΠ½ΡΠ΅ ΠΈ ΠΊΠΎΠ½ΡΠ΅ΠΊΡΡΠ½ΠΎ-ΡΠ²ΠΎΠ±ΠΎΠ΄Π½ΡΠ΅ ΡΠ·ΡΠΊΠΈ, ΠΈ ΠΌΠ°Π³Π°Π·ΠΈΠ½Π½ΡΠ΅ Π°Π²ΡΠΎΠΌΠ°ΡΡ. Π Π°Π½Π°Π»ΠΈΠ·Π΅ Π³ΡΠ°ΡΠΎΠ² ΠΈ Π°Π²ΡΠΎΠΌΠ°ΡΠΎΠ² ΠΏΡΠΈΠΌΠ΅Π½ΡΡΡΡΡ Π°Π»Π³Π΅Π±ΡΠ°ΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΌΠ΅ΡΠΎΠ΄Ρ.
A.I. Belousov, S.B. Tkachev, 2025
This textbook, part of the "Mathematics in Technical University" series, covers essential areas of discrete mathematics. It presents the fundamentals of set and relation theory, elements of abstract algebra, graph theory, and classical concepts of Boolean functions. The book also delves into the foundations of formal language theory, including finite automata, regular and context-free languages, and pushdown automata. Algebraic methods are emphasized in the analysis of graphs and automata.