The Complexity of Permutive Cellular Automata

NCU Institutional Repository > 理學院 > 數學系 > 期刊論文 > Item 987654321/51215

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/51215

题名:	The Complexity of Permutive Cellular Automata
作者:	Ban,JC;Chang,CH;Chen,TJ;Lin,MS
贡献者:	數學系
关键词:	REACTION-DIFFUSION EQUATIONS;EXCITABLE MEDIA;CHAOS
日期:	2011
上传时间:	2012-03-27 18:25:10 (UTC+8)
出版者:	國立中央大學
摘要:	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.
關聯:	JOURNAL OF CELLULAR AUTOMATA
显示于类别:	[數學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	659	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing