We study expansive invertible onesided cellular automata (i.e., expansive a
utomorphisms of onesided full shifts) and find severe dynamical and arithme
tic constraints which provide partial answers to questions raised by M. Nas
u [N2]. We employ the images and bilateral dimension groups, measure multip
liers, and constructive combinatorial characterizations for two classes of
cellular automata.