Results 251 to 260 of about 3,225 (296)
A formal statechart model of immediate neonatal adaptation guidelines. [PDF]
Sepúlveda-Oviedo EH +2 more
europepmc +1 more source
A Gentle Introduction to Lattice Field Theory. [PDF]
Seiler E.
europepmc +1 more source
Insertion attack identification in discrete event systems using petri nets with an observer. [PDF]
Ahmed AA, Chen Y, El-Sherbeeny AM.
europepmc +1 more source
Text cryptography and steganography based on RNA sequences generation, true random number generators, and codebook method. [PDF]
Hamad S, Rashid OF, Al-Dabbas HM.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Linear cellular automata and automatic sequences
Parallel Computing, 1997We study one-dimensional linear cellular automata with values in a finite ring. The orbit of an initial configuration can be considered as a double sequence. We study the generated double sequence from the point of view of automatic sequences. We present several results which show the usefulness of this concept in the study of cellular automata ...
G Skordev
exaly +2 more sources
Cesaro Sequences and Cesaro Hereditary Automata
We consider a class of so-called cesaro sequences over a finite alphabet, which possess the property of stability of the relative frequencies of occurrence of an arbitrary word in growing initial segments. This class includes a class of periodic sequences.
Sergey Yu. Melnikov +1 more
openaire +3 more sources
Exploring chaos automata for protein sequences
2008 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2008Fractals have been used to visually represent biological sequences since 1990. At first simple chaos games were used to generate fractal visualizations for DNA sequences, but the technique developed into using more complex systems to visually represent DNA and protein sequences.
Deborah Stoffer, L. Gwenn Volkert
exaly +2 more sources
Deriving Distinguishing Sequences for Input/Output Automata
2020 IEEE East-West Design & Test Symposium (EWDTS), 2020Input/Output (I/O) automata are widely used when deriving high quality tests for (components of) complex discrete systems based on so called distinguishing sequences. For I/O automata, the number of distinguishability relations is much bigger than for classical deterministic Finite State Machines (FSM).
Nina Yevtushenko, Igor Burdonov
exaly +2 more sources

