http://popups.lib.uliege.be/1373-5411/index.php?id=1954 Index terms 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=1953 The given paper investigates some strong anticipation characteristics, inherent to Automata Theory Problems. It is extracted anticipation's role in linear automaton's Controllability/Observability analysis. Via decision-making process presentation in terms of some special walks on some directed labelled multigraph, There is characterized strong anticipation for Problems of weakly initialized finite automaton's internal states identification, as well as of maximal supervisor's design for any discrete event automata-based system. Presentation of winning strategy's design for any Two-Players Game on a graph in terms of design of multi-headed Turing Machine with some arbiter and independently controlled heads outlines some general anticipatory characteristics, inherent to distributed computing. Wed, 17 Jul 2024 15:28:41 +0200 Wed, 17 Jul 2024 15:28:48 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=1953