In this paper we consider networks of evolutionary processors as language generating and computational devices. When the filters are regular languages one gets the computational power of Turing machines with networks of size at most six, depending on the underlying graph. When the filters are defined by random context conditions, we obtain an… (More)
Even Linear Language class is a subclass of context-free class. In this work we propose a characterization of this class using a relation of nite index. Theorems are provided in order to prove the consistence of the characterization. Finally, w e propose a method to learn this class using a reduction to the problem of learning regular languages.
We propose a computational device based on evolutionary rules and communication within a network, similar to that introduced in , called network of evolutionary processors. An NP-complete problem is solved by networks of evolutionary processors of linear size in linear time. Some furher directions of research are finally discussed.
In this paper, we study the notion of k-reversibility and k-testability when regular tree languages are involved. We present an inference algorithm for learning a k-testable tree language that runs in polynomial time with respect to the size of the sample used. We also study the tree language classes in relation to other well known ones, and some properties… (More)