The connection machine
Towards a new architecture for symbolic processing
AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
Journal of Computer and System Sciences
Networks of Parallel Language Processors
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Solving NP-Complete Problems With Networks of Evolutionary Processors
IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
On Networks of Evolutionary Processors with Nodes of Two Types
Fundamenta Informaticae - Machines, Computations and Universality, Part I
On the size of computationally complete hybrid networks of evolutionary processors
Theoretical Computer Science
Networks of evolutionary processors with subregular filters
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Hi-index | 0.00 |
Networks of evolutionary processors (NEPs, for short) form a bio-inspired language generating computational model that was shown to be equivalent to the model of phrase-structure grammars. In this paper, we analyse different restricted variants of NEPs that preserve the computational power of the general model. We prove that any recursively enumerable language can be generated by a NEP where the derivation rules can be applied at arbitrarily chosen positions, the control of the communication is done by finite automata with at most three states, and either the rule sets are singletons or the underlying graph is a complete graph. If one uses networks with arbitrary underlying graphs and allows the additional application of insertions and deletions only to the right-most or the to left-most position of the derived words for some nodes, then we only need automata with only one state to control the communication in the network. Clearly, this result is optimal; moreover, finite automata with two states are necessary and sufficient in order to generate all the recursively enumerable languages when the derivation rules can be applied only at arbitrarily chosen positions.