Network of Evolutionary Processors with Splicing Rules and Forbidding Context

2005 ◽  
pp. 300-309
Author(s):  
Ashish Choudhary ◽  
Kamala Krithivasan
Keyword(s):  
Network Of Evolutionary Processors

Network of Evolutionary Processors with Splicing Rules

2005 ◽  
pp. 290-299 ◽  
Author(s):  
Ashish Choudhary ◽  
Kamala Krithivasan
Keyword(s):  
Network Of Evolutionary Processors

Network of evolutionary processors with splicing rules and permitting context

Biosystems ◽  
2007 ◽  
Vol 87 (2-3) ◽  
pp. 111-116 ◽  
Author(s):  
Ashish Choudhary ◽  
Kamala Krithivasan
Keyword(s):  
Network Of Evolutionary Processors

ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS

2008 ◽  
Vol 19 (05) ◽  
pp. 1113-1132 ◽  
Author(s):  
CEZARA DRĂGOI ◽  
FLORIN MANEA
Keyword(s):  
Point Of View ◽  
The Other ◽  
Input Word ◽  
Output Node ◽  
Descriptional Complexity ◽  
Recursively Enumerable ◽  
Enumerable Language ◽  
Network Of Evolutionary Processors ◽  
Nondeterministic Turing Machine ◽  
The Given

In this paper we consider, from the descriptional complexity point of view, a model of computation introduced in [1], namely accepting network of evolutionary processors with filtered connections (ANEPFCs). First we show that for each morphism h : V → W*, with V ∩ W = ∅, one can effectively construct an ANEPFC, of size 6 + |W|, which accepts every input word w and, at the end of the computation on this word, obtains h(w) in its output node. This result can be applied in constructing two different ANEPFCs, with 27 and, respectively, 26 processors, recognizing a given recursively enumerable language. The first architecture, based on the construction of a universal ANEPFC, has the property that only 7 of its 27 processors depend on the accepted language. On the other hand, all the 26 processors of the second architecture depend on the accepted language, but, differently from the first one, this network simulates efficiently (from both time and space perspectives) a nondeterministic Turing machine accepting the given language.

scholarly journals A Universal Accepting Hybrid Network of Evolutionary Processors

2006 ◽  
Vol 135 (3) ◽  
pp. 95-105 ◽  
Author(s):  
Florin Manea ◽  
Carlos Martín-Vide ◽  
Victor Mitrana
Keyword(s):  
Hybrid Network ◽  
Network Of Evolutionary Processors

scholarly journals Simulations between Network Topologies in Networks of Evolutionary Processors

Axioms ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 183
Author(s):  
José Ángel Sánchez Martín ◽  
Victor Mitrana
Keyword(s):  
Complete Graph ◽  
Time Complexity ◽  
Star Graph ◽  
Constant Number ◽  
Grid Graph ◽  
Arbitrary Topology ◽  
Underlying Graph ◽  
Network Of Evolutionary Processors ◽  
Network Topologies ◽  
The Given

In this paper, we propose direct simulations between a given network of evolutionary processors with an arbitrary topology of the underlying graph and a network of evolutionary processors with underlying graphs—that is, a complete graph, a star graph and a grid graph, respectively. All of these simulations are time complexity preserving—namely, each computational step in the given network is simulated by a constant number of computational steps in the constructed network. These results might be used to efficiently convert a solution of a problem based on networks of evolutionary processors provided that the underlying graph of the solution is not desired.

Sign in / Sign up

Export Citation Format

Share Document