Article
Licensed
Unlicensed
Requires Authentication
On the periodicity of the sequence of states of an automaton corresponding to a given initial state and a given periodic input sequence
-
A.V. Babash
Published/Copyright:
February 2, 2016
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.
Published Online: 2016-2-2
Published in Print: 2002-6-1
© 2016 by Walter de Gruyter Berlin/Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Editorial
- On inherited properties of restricted Boolean functions
- Some properties of the inertia groups of Boolean bijunctive functions and an inductive method of generating such functions
- On complexity of representation of multiple-valued logic functions as polarised polynomials
- On the periodicity of the sequence of states of an automaton corresponding to a given initial state and a given periodic input sequence
- On the analysis of fuzzy information graphs
- Lattices of Ω-foliated formations
- A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic
- On some conditions for absence of a giant component in the generalised allocation scheme
- On 2-regular graphs whose girth is one less than the maximum
- Forthcoming Papers
- Contents
Articles in the same Issue
- Editorial
- On inherited properties of restricted Boolean functions
- Some properties of the inertia groups of Boolean bijunctive functions and an inductive method of generating such functions
- On complexity of representation of multiple-valued logic functions as polarised polynomials
- On the periodicity of the sequence of states of an automaton corresponding to a given initial state and a given periodic input sequence
- On the analysis of fuzzy information graphs
- Lattices of Ω-foliated formations
- A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic
- On some conditions for absence of a giant component in the generalised allocation scheme
- On 2-regular graphs whose girth is one less than the maximum
- Forthcoming Papers
- Contents
