搜索结果: 1-15 共查到“数学 CELLULAR AUTOMATA”相关记录22条 . 查询时间(0.05 秒)
EXPANSIVE INVERTIBLE ONESIDED CELLULAR AUTOMATA
EXPANSIVE INVERTIBLE ONESIDED CELLULAR AUTOMATA
font style='font-size:12px;'>
2015/9/29
We study expansive invertible onesided cellular automata (i.e., expansive automorphisms of onesided full shifts) and find severe dynamical and arithmetic constraints which provide partial answers to q...
JOINTLY PERIODIC POINTS IN CELLULAR AUTOMATA:COMPUTER EXPLORATIONS AND CONJECTURES
JOINTLY PERIODIC POINTS CELLULAR AUTOMATA COMPUTER EXPLORATIONS AND CONJECTURES
font style='font-size:12px;'>
2015/9/29
We develop a rather elaborate computer program to investigate the jointly periodic points of one-dimensional cellular automata. The experimental results and mathematical context lead to questions, con...
A Characterization of Cellular Automata Generated by Idempotents on the Full Shift
cellular automata marker lemma products of idempotents decidability
font style='font-size:12px;'>
2012/6/19
In this article, we discuss the family of cellular automata generated by so-called idempotent cellular automata (CA G such that G^2 = G) on the full shift. We prove a characterization of products of i...
Cellular Automata Rules and Linear Numbers
Cellular Automata linear and non-linear rules linear and non-linear numbers
font style='font-size:12px;'>
2012/4/27
In this paper, linear Cellular Automta (CA) rules are recursively generated using a binary tree rooted at "0". Some mathematical results on linear as well as non-linear CA rules are derived. Integers ...
Boundary growth in one-dimensional cellular automata
Boundary growth one-dimensional cellular automata
font style='font-size:12px;'>
2012/4/26
We systematically study the boundaries of one-dimensional, 2-color cellular automata depending on 4 cells, begun from simple initial conditions. We determine the exact growth rates of the boundaries t...
Non-Uniform Cellular Automata: classes, dynamics, and decidability
cellular automata non-uniform cellular automata decidability symbolic dynamics
font style='font-size:12px;'>
2011/10/9
Abstract: The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples....
Time-Symmetric Cellular Automata
time-symmetry reversibility universality
font style='font-size:12px;'>
2010/12/28
Together with the concept of reversibility, another relevant physical notion is time-symmetry, which expresses that there is no way of distinguishing between backward and forward time directions. This...
A Categorical Outlook on Cellular Automata
Categorical Outlook Cellular Automata
font style='font-size:12px;'>
2011/3/2
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g.,
Infinite Time Cellular Automata: A Real Computation Model
Infinite Time Cellular Automata Computation Model
font style='font-size:12px;'>
2010/12/28
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and infinite inputs; thu...
A Categorical Outlook on Cellular Automata
Categorical Outlook Cellular Automata
font style='font-size:12px;'>
2010/12/28
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comonads.
A Simulation of Oblivious Multi-Head One-Way Finite Automata by Real-Time Cellular Automata
Simulation of Oblivious Multi-Head One-Way Finite Automata Real-Time Cellular Automata
font style='font-size:12px;'>
2010/12/28
In this paper, we present the simulation of a simple, yet significantly powerful, sequential model by cellular automata. The simulated model is called oblivious multi-head one-way finite automata and ...
On algebraic cellular automata
On algebraic cellular automata math
font style='font-size:12px;'>
2010/11/24
We investigate some general properties of algebraic cellular automata, i.e., cellular automata over groups whose alphabets are affine algebraic sets and which are locally defined by regular maps. When...
Sensitivity to noise and ergodicity of an assembly line of cellular automata that classifies density
Statistical Mechanics (cond-mat.stat-mech) Disordered Systems and Neural Networks (cond-mat.dis-nn) Cellular Automata and Lattice Gases (nlin.CG)
font style='font-size:12px;'>
2010/11/10
We investigate the sensitivity of the composite cellular automaton of H. Fuk\'{s} (Phys. Rev. E 55, R2081 (1997)) to noise and assess the density classification performance of the resulting probabilis...
Complex networks derived from cellular automata
complex networks cellular automata scale-free small-world
font style='font-size:12px;'>
2010/12/16
We propose a method for deriving networks from one-dimensional binary cellular automata. The derived networks are usually directed and have structural properties corresponding to the dynamical behavio...
Complexity and Stochastic Synchronization in Coupled Map Lattices and Cellular Automata
Complexity Stochastic Synchronization Coupled Map Lattices Cellular Automata
font style='font-size:12px;'>
2010/12/15
Nowadays the question ‘what is complexity?’ is a challenge to be answered. This question
is triggering a great quantity of works in the frontier of physics, biology, mathematics and
computer science...