http://popups.lib.uliege.be/1373-5411/index.php?id=287 Publications of Auteurs Alexander A. Sytnik fr 0 http://popups.lib.uliege.be/1373-5411/index.php?id=4384 This article is about website optimization on the basis of semantic segmentation of its hypertext pages. Automata model for hypertext is introduced to describe hypertext organization of website. According to this model states of automaton correspond to hypertext pages and transitions correspond to hypertext links. Then the algorithm of segmentation for hypertext pages based on calculating automata congruences/tolerances is offered. The segmentation is produced by partitioning of states for some congruence or covering of states for some tolerance. The algorithm work under consideration of degrees for hyperlinks and pages, assigned during statistic supervision for website. To achieve appropriative result the initial automaton is consequently modified by decreasing its connectedness. Thu, 10 Oct 2024 10:10:18 +0200 Thu, 10 Oct 2024 10:10:35 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=4384 http://popups.lib.uliege.be/1373-5411/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. Fri, 30 Aug 2024 11:15:47 +0200 Thu, 10 Oct 2024 16:36:51 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2696 http://popups.lib.uliege.be/1373-5411/index.php?id=2246 A problem of synthesis of fault - tolerant computing systems which mathematical model is the deterministic finite automata is considered. The novelty in this paper is construnction of the object called as a bundle of automats whose operation is based on constant alternation of function of automats which are his components. It is shown that model of a bundle of automats at a design phase of discrete systems with memory may be used to proceed in operational period to signals generation corresponding to the required algorithm of functioning in enumerating form. Tue, 30 Jul 2024 15:36:09 +0200 Tue, 30 Jul 2024 15:36:16 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2246 http://popups.lib.uliege.be/1373-5411/index.php?id=2239 In the Theory of Systems attention is traditionally directed to the problems of control, diagnostics and correction of complex systems behavior. At present a devices and technologies are very complicate and the problem of generating goal-directed behavior is one of prior. In the general case (that is, for an arbitrary complex system) the problem of generating goal-directed behavior is algorithmically insoluble, but it can be solved by imposing certain restrictions on the system behavior. Approach to a decision of referred above problem in class of intellectual systems described by one-to-one transformations (without loss of information) is offered in this scientific work. Tue, 30 Jul 2024 15:26:23 +0200 Thu, 10 Oct 2024 16:37:17 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2239 http://popups.lib.uliege.be/1373-5411/index.php?id=229 This paper suggests a model of Distributed Discrete Object Environment(DDOE), for describing object-oriented computing and compares it to traditional structured automaton model. Wed, 19 Jun 2024 14:26:24 +0200 Wed, 19 Jun 2024 15:40:48 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=229