On the size complexity of hybrid networks of evolutionary processors

AbstractThe goal of this paper is twofold. Firstly, to survey in a systematic and uniform way the main results regarding the size descriptional complexity measures of hybrid networks of evolutionary processors as generating devices. Secondly, we improve some results about a size measure, prove that it is connected, and discuss the possibility of computing this measure for regular and context-free languages. We also briefly present a few NP-complete problems and recall how they can be solved in linear time by accepting networks of evolutionary processors with linearly bounded resources (nodes, rules, symbols). Finally, the size complexity of accepting hybrid networks of evolutionary processors recognizing all NP languages in polynomial time is briefly discussed