首页 | 本学科首页   官方微博 | 高级检索  
     


Prevalence and structure of adding machines for cellular automata
Authors:Emma D'Aniello
Affiliation:a Dipartimento di Matematica, Seconda Università degli Studi di Napoli, Via Vivaldi 43, 81100 Caserta, Italy
b Department of Sciences and Mathematics, American University of Rome, Via Pietro Roselli 4, 00153 Roma, Italy
Abstract:Consider the collection of left permutive cellular automata Φ with no memory, defined on the space S of all doubly infinite sequences from a finite alphabet. There exists View the MathML source, a dense subset of S, such that View the MathML source is topologically conjugate to an odometer for all View the MathML source so long as Φm is not the identity map for any m. Moreover, Φ generates the same odometer for all View the MathML source. The set View the MathML source is a dense Gδ subset with full measure of a particular subspace of S.
Keywords:Odometer   Adding machine   Cellular automaton
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号