In this paper we concern an abstract model of self-organizing process called local cellular automata (LCA) proposed by us recently. The circular organization of living systems is addressed. A consistent circularity is defined by a closure operation on complete lattice. An inconsistent circularity is defined by a quasi-closure called weak closure implied by an internal perspective. Each cell in a LCA receives data about the time developments of its neighbors at one step before. It constructs a (in general incomplete) look-up table by taking closure (or weak closure) of the received data on an appropriate lattice. It applies obtained rule to its own present state and changes the state. In the former half of the paper, the theory which is the basis for LCA based on set lattice is reformulated in terms of complete lattice. In the latter half, we restrict cells' information receiving ability and define restricted local cellular automata (RLCA). The space-time patterns of RLCA are estimated by the variance of input-entropy over a span of time steps. The difference between closure driven RLCA and weak closure driven RLCA is discussed.