Accepting networks of splicing processors with filtered connections

  • Authors:

  • Juan Castellanos;Florin Manea;Luis Fernando de Mingo López;Victor Mitrana

  • Affiliations:

  • Department of Artificial Intelligence, Polytechnical University of Madrid, Madrid, Spain;Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania;Dept. Organización y Estructura de la Información, Escuela Universitaria de Informática, Universidad Politécnica de Madrid, Madrid, Spain;Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania and Research Group in Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

  • Venue:
  • MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we simplify accepting networks of splicing processors considered in [8] by moving the filters from the nodes to the edges. Each edge is viewed as a two-way channel such that input and output filters coincide. Thus, the possibility of controlling the computation in such networks seems to be diminished. In spite of this and of the fact that splicing alone is not a very powerful operation these networks are still computationally complete. As a consequence, we propose characterizations of two complexity classes, namely NP and PSPACE, in terms of accepting networks of restricted splicing processors with filtered connections.