Abstract:
We describe the automata which transfer any periodic input sequence into a periodic
output sequence. We suggest an algorithm for checking whether a given automaton has this
property and give upper bounds for the complexity of the algorithm.