Abstract
The theory of automata combines ideas from engineering, linguistics, mathematics, philosophy, etc. The Entscheidungsproblem asks if it is possible to design a series of steps that replaces a mathematician. An automaton is an abstract machine that processes data. C. Shannon's theory is today's most popular despite having no relationship with the other. The Kt system is called "minimal" because it makes no assumptions about the structure of time. In LKt, we have four monary temporal operators, F, P, G and H, which are mutually interdefinable. Interdefinability means that we will pass logic in the future is the same as saying I will never fail logic, interpreting not passing logic as failing logic. The minimal system syntax of temporal logic introduces operators that have the property of being defined in terms of others. Modal logic studies the reasoning that involves the use of expressions "necessarily" and "possibly". In this article, we will represent through a finite automaton the temporal logic formula Fp. It allows us to see an acceptance pattern for Fp by considering two variables: p and q. Kt's axiomatic system of time expresses the idea that both the present and the past are fixed, if it has always been in the past that it will be some time in the future that p is now. No philosophical argument supports deterministic time flow; the logic of time must be open.Temporal logic has revived many old problems, from the Megaric-Stoics to the minimal system of temporal logic. Our work suggests that the future operators of system Kt follow an evaluation pattern, but we must be cautious because this pattern can only apply to models whose time flow is based on instants and precedence relations.
