Theory of functional systems is a section of discrete mathematics that studies the functions that describe the operation of discrete converters .
In the theory of functional systems, the following classes of functions are considered:
- boolean functions
- k- valued logic functions
- automaton functions
- computable functions
Operations are naturally associated with each of these classes, which make it possible to construct other functions of the same class from some functions of a given class. Such operations are the superposition operation (substitution) , the feedback operation, the primitive recursion operation, and -operation (minimization) . The result is functional systems with operations.
Literature
Yablonsky S.V. Introduction to discrete mathematics: Textbook. manual for universities. - 2nd ed., Revised. and add. - M .: Science. Ch. ed. Phys.-Math. lit., 1986 .-- 384 p.