Results 271 to 280 of about 3,225 (296)
Some of the next articles are maybe not open access.
Finite Automata on Transfinite Sequences and Regular Expressions
Fundamenta Informaticae, 1985In this paper the notion of regular expression for finite automata on transfinite sequences /TF-automata/ is introduced. The characterization theorem for TF-automata is proved. From this theorem we conclude the decidability of the emptiness problem for TF-automata and the characterization theorem for finite automata on transfinite sequences of bounded ...
openaire +2 more sources
Towards modeling DNA sequences as automata
Physica D: Nonlinear Phenomena, 1984Abstract We seek to describe a starting point for modeling the evolution and role of DNA sequences within the framework of cellular automata by discussing the current understanding of genetic information storage in DNA sequences. This includes alternately viewing the role of DNA in living organisms as a simple scheme and as a complex scheme; a brief ...
Christian Burks, Doyne Farmer
openaire +1 more source
Sequences generated by neuronal automata with memory
Complex Syst., 1992Summary: We study the sequences generated by neuronal recurrence equations of the form \[ x_ n=1[\sum_{1\leq i\leq k}a_ ix_{n-i}-\theta], \] where \(k\) is called the memory length. We show that, if there is a neuronal recurrence equation with memory length \(k\) that generates sequences of periods \(p_ 1,\ldots,p_ r\), then there is a neuronal ...
Michel Cosnard +2 more
openaire +2 more sources
On Pseudo-Random Sequences over Finite Automata
Fundamenta Informaticae, 1985It is a well-known fact that binary sequences (strings) of high algorithmic complexity can be taken as good approximations of statistically independent random sequences with two equiprobable outputs. Here “sequence of high algorithmic complexity” is such one, that the length of the shortest program generating this sequence by a universal Turing machine
openaire +2 more sources
Sequence Automata for Researching Consensus Levels
2011Having a group of ranking lists (ordered sequences) we can use different theories to research a scale of consistency according to the assessments contained in it. The agreement of ordered (queue) objects can be estimated as the maximal length of preference subsequences i.e. a maximal set of objects with the same queue of dominance relation.
openaire +1 more source
Synchronizing Sequences for Probabilistic Automata
Studies in Applied Mathematics, 1970openaire +2 more sources
On sequences of Mealy automata and their limits
2019We introduce the notions of n-state Mealy automaton sequence and limit of this sequence. These notions are illustrated by the 2-state Mealy automaton sequences that have the set of finite limit automata.
openaire +1 more source
Finite automata acceptation of infinite sequences
1975Klaus W. Wagner, Ludwig Staiger
openaire +1 more source
Cellular automata for generating deterministic test sequences
Proceedings European Design and Test Conference. ED & TC 97, 2002Dimitrios Kagaris, Spyros Tragoudas
openaire +1 more source