  In this article, I propose a systematic method for the inverse
ultra-discretization of cell automata using a functionally complete operation.
We derive difference equations for the 256 kinds of elementary cellular
automata(ECA) introduced Wolfram\cite{wolfram} by the proposed means of the
inverse ultra-discretization. We show that the behaviors of ECAs can be
completely reproduced by numerically solving the obtained difference equations.
