Abstract:
Let $X^*$ be the set of words over a finite alphabet $X$.
The concept of periodic function $u\colon X^*\to M$ is considered.
Such functions arise as the state transition functions and the output functions of automata.
A method for the evaluation of the period and other characteristics of a periodic function with the use of the vector-period group and the fundamental group of the graph of the function
is put forward.
Bibliography: 5 titles.