抄録
We study expansive invertible onesided cellular automata (i.e., expansive automorphisms of onesided full shiftσ) and find severe dynamical and arithmetic constraints which provide partial answers to questions raised by M. Nasu [{N2}]. We employ the images and bilateral dimension groups, measure multipliers, and constructive combinatorial characterizations for two classes of cellular automata.
