Networks of Evolutionary Picture Processors
Prof. Dr. Victor Mitrana
(Faculty of Mathematics and Computer Science, Univ. of Bucharest and
Department of Information Systems and Computation, Technical University of Valencia)

Place: Room 0S03 (Ground floor at the DSIC building in front of Secretariat)
Date: 12/02/2009
Time: 12:30
Abstract

We extend the study of accepting networks of evolutionary processors to rectangular pictures by introducing networks of evolutionary picture processors. Two ways of accepting pictures are considered: weak acceptance, when at least one output node is nonempty, and strong acceptance, when all output nodes are nonempty. Every language weakly accepted by a network can be strongly accepted by another network. The closure properties of these devices under some common operations on picture languages are briefly investigated. We show that networks of evolutionary picture processors can weakly accept the complement of any local language, as well as languages that are not recognizable. The problem of pattern matching in pictures is then considered in the framework of networks of evolutionary picture processors. A partial solution to this problem is given for the weak acceptance case and a similar result is discussed for the strong acceptance. Some open problems are finally discussed.