On CD-Systems of Stateless Deterministic R(2)-Automata
Benedek Nagy · University of Debrecen Electronic Archive (University of Debrecen) · 2011
In this paper cooperated distributed (CD) systems of stateless deterministic restarting automata are shown where each component has window size 2 and finishes its process by accepting/ declining or by deleting one or two letters currently under the window. We show that these systems are proper extensions of CD-systems of stateless deterministic R(1)-Automata; all linear context-free languages and some non semi-linear languages can be accepted. Closure of the accepted language class under set theoretical operations are also analysed.