搜索结果: 1-15 共查到“数学 cellular”相关记录40条 . 查询时间(0.109 秒)
EXPANSIVE INVERTIBLE ONESIDED CELLULAR AUTOMATA
EXPANSIVE INVERTIBLE ONESIDED CELLULAR AUTOMATA
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
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...
We consider a reaction-diffusion equation in a cellular flow. We prove that in the strong flow regime there are two possible scenario for the initial data that is compactly supported and the size of t...
Bounds on the speed of propagation of the KPP fronts in a cellular flow
propagation KPP fronts cellular flow
2015/7/14
We consider a reaction-diffusion-advection equation with a nonlinearity of the KPP type in a cellular flow. We show that the minimal pulsating traveling front speed c∗(A) in a flow ofamplitude A...
We consider an elliptic eigenvalue problem with a fast cellular flow of amplitude A, in a twodimensional domain with L2 cells. For fixed A, and L → ∞, the problem homogenizes, and has been well studie...
A Characterization of Cellular Automata Generated by Idempotents on the Full Shift
cellular automata marker lemma products of idempotents decidability
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
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
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...
A Numerical Study of Turbulent Flame Speeds of Curvature and Strain G-equations in Cellular Flows
Curvature/Strain G-equations Cellular Flows Front Speed Computation Enhancement and Quenching
2012/2/29
We study front speeds of curvature and strain G-equations arising in turbulent combustion. These G-equations are Hamilton-Jacobi type level set partial differential equations (PDEs) with non-coercive ...
Non-Uniform Cellular Automata: classes, dynamics, and decidability
cellular automata non-uniform cellular automata decidability symbolic dynamics
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....
This paper introduces a general theoretical framework to analyze noise limited networks. More precisely, we consider two ho-mogenous Poisson point processes of base stations and users.
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...
Cellular and quasihereditary structures of generalized quantized Schur algebras
Cellular quasihereditary structures generalized quantized Schur algebras
2011/3/1
We give a self-contained derivation of a new cellular basis of generalized quantized Schur algebras, independent of the theory of quantum groups.
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
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...