https://popups.uliege.be/3041-539x/index.php?id=2696 In this paper the problem of discrete systems goal-directed behavior generating is considered. The finite-state machine represents a model of a discrete system. The problem of goal-directed behavior generating is solved by the theory of the universal finite-state machine. The class of finite-state machine simulated by a family of the polynomials is described. The using of this "numerical" model of behavior of finite state machine allows to apply the algebraic methods to solve the problem of goal directed behavior generating. For the described class analysis and synthesis problems of universal enumerator are solved. Full text issues Volume 14 Computer Science and Models Simulation fr Fri, 30 Aug 2024 11:15:47 +0200 Thu, 10 Oct 2024 16:36:51 +0200 https://popups.uliege.be/3041-539x/index.php?id=2696 0