AbstractSequences produced by cellular automata (CA) are studied algebraically. A suitable k-cell 90/150 CA over Fq generates a sequence of length qk−1. The temporal sequence of any cell of such a CA can be obtained by shifting the temporal sequence of any other cell. We obtain a general algorithm to compute these relative shifts. This is achieved by developing the proper algebraic framework for the study of CA sequences
Study of the evolution of species or organisms is essential for various biological applications. Evo...
A cellular automaton (or CA) is an interconnected set of finite state machines (or cells) such that ...
4siCellular Automata (CA) are a computational model widely used in many scientific fields. A CA cons...
A technique for determining fixed points and shift cycles in one-and two-dimensional cellular automa...
AbstractA cellular automation is an array of regularly interconnected identical cells. We study here...
Numerical calculation uses to describe the operation of matrix permutation algorithms based on cycli...
This thesis analyses the computational capabilities of cellular automata working on periodical confi...
AbstractIbarra (1985) showed that, given a cellular automaton of range 1 recognizing some language i...
Cellular automata (CA) is an example of cellular computing: large numbers of simple components, no c...
Difficulty of designing Cellular Automata (CA) structure that performs temporal sequence generation ...
AbstractIn the computational-mechanics structural analysis of one-dimensional cellular automata the ...
In the computational-mechanics structural analysis of one-dimensional cellular automata the followin...
International audienceWe present recent studies on cellular automata (CAs) viewed as discrete dynami...
International audienceCellular Automata (CA) are a computational model widely used in many scientifi...
International audienceThis paper deals with the construction of shift-invariant maximal filters on ℤ...
Study of the evolution of species or organisms is essential for various biological applications. Evo...
A cellular automaton (or CA) is an interconnected set of finite state machines (or cells) such that ...
4siCellular Automata (CA) are a computational model widely used in many scientific fields. A CA cons...
A technique for determining fixed points and shift cycles in one-and two-dimensional cellular automa...
AbstractA cellular automation is an array of regularly interconnected identical cells. We study here...
Numerical calculation uses to describe the operation of matrix permutation algorithms based on cycli...
This thesis analyses the computational capabilities of cellular automata working on periodical confi...
AbstractIbarra (1985) showed that, given a cellular automaton of range 1 recognizing some language i...
Cellular automata (CA) is an example of cellular computing: large numbers of simple components, no c...
Difficulty of designing Cellular Automata (CA) structure that performs temporal sequence generation ...
AbstractIn the computational-mechanics structural analysis of one-dimensional cellular automata the ...
In the computational-mechanics structural analysis of one-dimensional cellular automata the followin...
International audienceWe present recent studies on cellular automata (CAs) viewed as discrete dynami...
International audienceCellular Automata (CA) are a computational model widely used in many scientifi...
International audienceThis paper deals with the construction of shift-invariant maximal filters on ℤ...
Study of the evolution of species or organisms is essential for various biological applications. Evo...
A cellular automaton (or CA) is an interconnected set of finite state machines (or cells) such that ...
4siCellular Automata (CA) are a computational model widely used in many scientific fields. A CA cons...
DOI
Add to ORKG