Article
Licensed
Unlicensed
Requires Authentication
Periods of output sequences of an automaton for a given periodic input sequence
-
A. V. Babash
Published/Copyright:
January 11, 2010
Abstract
In this research we give lower bounds for periods of output sequences of automata for a given periodic input sequence.
Received: 2006-07-11
Revised: 2008-08-15
Published Online: 2010-01-11
Published in Print: 2009-December
© de Gruyter 2009
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On quantum realisation of Boolean functions by the fingerprinting technique
- On the choice of the defence strategy for an authentication code with two-state source
- A parametric model of embedding and its statistical analysis
- On some equations related to the tpp-groups
- Description of finite nonnilpotent rings with planar zero-divisor graphs
- Rings over which all finitely generated modules are ℵ0-injective
- On the number of boundary classes in the 3-colouring problem
- Periods of output sequences of an automaton for a given periodic input sequence
- On the complexity of representation of k-valued functions by generalised polarised polynomials
Articles in the same Issue
- On quantum realisation of Boolean functions by the fingerprinting technique
- On the choice of the defence strategy for an authentication code with two-state source
- A parametric model of embedding and its statistical analysis
- On some equations related to the tpp-groups
- Description of finite nonnilpotent rings with planar zero-divisor graphs
- Rings over which all finitely generated modules are ℵ0-injective
- On the number of boundary classes in the 3-colouring problem
- Periods of output sequences of an automaton for a given periodic input sequence
- On the complexity of representation of k-valued functions by generalised polarised polynomials
