PYRAMID CELLULAR ACCEPTORS
暂无分享,去创建一个
This chapter discusses a special class of cellular acceptors, called pyramid acceptors, which can accept many languages in much less than O diameter time at only a slight cost in additional hardware. Each cell, in addition to being able to sense the states of its four neighbors or brother cells, can also sense the states of four son cells in the layer below it and of a father cell in the layer above it. The input to be accepted is stored in the base layer; the other layers are initially in a quiescent state. The input is accepted if the apex cell enters an accepting state. The chapter defines pyramid acceptors and their analogs, namely, triangle acceptors, which accept one-dimensional input. The chapter also discusses a simplification of these definitions in which a cell is only allowed to sense the states of its sons but not of its brothers or its father, so that the information can only flow upward from the base to the apex.
[1] james w.thatcher,et al. tree automata: an informal survey , 1974 .
[2] Azriel Rosenfeld,et al. Cellular Pyramids for Image Analysis. , 1977 .
[3] Richard Edwin Stearns,et al. Hierarchies of memory limited computations , 1965, SWCT.