Sequences Generated by Neuronal Automata with Memory
نویسندگان
چکیده
We st udy th e sequences generated by neuronal recurrence equat ions of th e form X n = l [~l then there is a neuronal recurrence equat ion with memory length kr that generates a sequence of period lcmlp «, . . . , Pr )1', where lem deno tes the least common multiple. As an applicat ion we show tha t , for any integer ko, there is a neuronal equa tion with memory lengt h 3k , k 2:: ko, that generates a sequence of period O(k3 ) .
منابع مشابه
Exponential Period of Neuronal Recurrence Automata with Excitatory Memory
The sequences generated by a neuronal recurrence equation with memory of the form x(n) 1[ h i1 a i x(n i) Θ], where h is the size of the memory, are studied. It is shown that in the case where all the parameters (a i) 1ih are positive reals, there exists a neuronal recurrence equation of memory length h that generates a sequence of period (e 3 h(ln(h)) 2). This result shows that in the case whe...
متن کاملNo Polynomial Bound for the Period of Neuronal Automata with Inhibitory Memory
We study the sequences generated by a neuronal equation with memory of the form xn " 1[!ki"1 aixn#i # Θ], where k is the size of the memory. We show that in the case where all the parameters (ai)1%i%k are negative real numbers, there exists a neuronal equation of memory length k that generates a sequence of period e " k log . This result shows that in the case where all weighting coefficients a...
متن کاملCyclic Evolution of Neuronal Automata with Memory When All the Weighting Coefficients are Strictly Positive
In this paper we study the sequences generated by a neuronal equation of the form xn " 1[!ki"1 aixn#i # Θ], where k is the size of the memory. We show that in the case where all the parameters (ai)1%i%k are strictly positive reals and k is a multiple of 6 (i.e., k " 6m), there exists a subset B " &w1, w2, . . . , wΑ( of &1, 2, . . . , m # 1( and for which there exists a neuronal equation of mem...
متن کاملEnergy Efficient Novel Design of Static Random Access Memory Memory Cell in Quantum-dot Cellular Automata Approach
This paper introduces a peculiar approach of designing Static Random Access Memory (SRAM) memory cell in Quantum-dot Cellular Automata (QCA) technique. The proposed design consists of one 3-input MG, one 5-input MG in addition to a (2×1) Multiplexer block utilizing the loop-based approach. The simulation results reveals the excellence of the proposed design. The proposed SRAM cell achieves 16% ...
متن کاملA characterization of p-automatic sequences as columns of linear cellular automata
We show that a sequence over a finite field Fq of characteristic p is p-automatic if and only if it occurs as a column of the spacetime diagram, with eventually periodic initial conditions, of a linear cellular automaton with memory over Fq . As a consequence, the subshift generated by a length-p substitution can be realized as a topological factor of a linear cellular automaton.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Complex Systems
دوره 6 شماره
صفحات -
تاریخ انتشار 1992