Automata-Based Anticipatory Systems

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.