This paper presents a four-dimensional computational
model, k-neighborhood template A-type three-dimensional bounded
cellular acceptor (abbreviated as A-3BCA(k)), and discusses the
hierarchical properties. An A-3BCA(k) is a four-dimensional
automaton which consists of a pair of a converter and a
configuration-reader. The former converts the given four-dimensional
tape to the three- and two- dimensional configuration and
the latter determines the acceptance or nonacceptance of given
four-dimensional tape whether or not the derived two-dimensional
configuration is accepted. We mainly investigate the difference of the
accepting power based on the difference of the configuration-reader.
It is shown that the difference of the accepting power of the
configuration-reader tends to affect directly that of the A-3BCA(k)
for the case when the converter is deterministic. On the other hand,
results are not analogous for the nondeterministic case.