This article is cited in 1 paper

On the periodicity of the sequence of states of an automaton corresponding to the initial state and the input periodic sequence

A. V. Babash


Abstract: We introduce a formalisation of the intuitive notion of almost periodicity of elements of a finite alphabet, the measure of approximate period of this sequence. We obtain a lower bound of the measure of approximate period of the sequence of states of an automaton for a given initial state and a given periodic input sequence. On the base of this estimate, we obtain a lower bound for the measures of approximate periods of output sequences of automata modelling the functioning of shift registers.

UDC: 519.7

Received: 17.05.2000
Revised: 14.02.2002

DOI: 10.4213/dm241

 English version: Discrete Mathematics and Applications, 2002, 12:3, 235–246

Bibliographic databases:

• 
•