SPECIAL TYPES OF ACCEPTORS
暂无分享,去创建一个
This chapter discusses three specialized acceptor models: (1) pebble acceptors, which cannot rewrite their input but can make marks on it, with the restriction that only a bounded number of these marks can exist at any given time, (2) pushdown acceptors, which cannot rewrite their input but can store a string of symbols in such a way that only the last symbol in the string can be read, and (3) parallel/sequential acceptors, which are one-dimensional cellular acceptors that read one row of a rectangular input array at a time and move up and down to scan the array. A class of acceptors, called pebble acceptors or marking acceptors, have limited writing ability. Such an acceptor can make marks on its input, but only a bounded number of these marks can exist at any given time.
[1] Stanley M. Selkow. One-Pass Complexity of Digital Picture Properties , 1972, JACM.
[2] JOHN MYLOPOULOS. On the recognition of topological invariants by 4-way finite automata , 1972, Comput. Graph. Image Process..
[3] Azriel Rosenfeld,et al. Parallel / Sequential Array Automata , 1973, Inf. Process. Lett..
[4] Anupam N. Shah. Pebble automata on arrays , 1974, Comput. Graph. Image Process..
[5] Azriel Rosenfeld,et al. Two heads are better than one , 1976, Inf. Sci..