The Complexity of Permutive Cellular Automata

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/51215

Title:	The Complexity of Permutive Cellular Automata
Authors:	Ban,JC;Chang,CH;Chen,TJ;Lin,MS
Contributors:	數學系
Keywords:	REACTION-DIFFUSION EQUATIONS;EXCITABLE MEDIA;CHAOS
Date:	2011
Issue Date:	2012-03-27 18:25:10 (UTC+8)
Publisher:	國立中央大學
Abstract:	This paper studies one-dimensional permutive cellular automata in two aspects: Ergodic and topological behavior. Through investigating measure-theoretic entropy and topological pressure, we show taht Parry measure is the unique equilibrium measure whenever the potential function depends on one coordinate. In other words, permutive cellular automata exhibit no phase transition. Furthermore, the existence of snap-back repellers for a cellular automaton infers Li-Yorke chaos and bipermutive cellular automata guarantee the subsistence of snap-back repellers.
Relation:	JOURNAL OF CELLULAR AUTOMATA
Appears in Collections:	[Department of Mathematics] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	688	View/Open

社群 sharing