Automata-Based Anticipatory Systems
p. 109-124
Résumé
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.
Index
Notes de la rédaction
This research was srpported, in part, through the Project 'Logic Appoach in Dynamic Systems' Control', Reg. : 01024565
Texte
Citer cet article
Référence papier
Volodomy G. Skobelev, « Automata-Based Anticipatory Systems », CASYS, 15 | 2004, 109-124.
Référence électronique
Volodomy G. Skobelev, « Automata-Based Anticipatory Systems », CASYS [En ligne], 15 | 2004, mis en ligne le 17 July 2024, consulté le 20 September 2024. URL : http://popups.lib.uliege.be/1373-5411/index.php?id=1953
Auteur
Volodomy G. Skobelev
Institute of Applied Mathematics and Mechanics of National Academy of Sciences of Ukraine, Rose Luxemburg Str., 74, Donetsk, 83114, Ukraine