The connection machine
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
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 the size complexity of hybrid networks of evolutionary processors
Theoretical Computer Science - Descriptional complexity of formal systems
Context-free insertion-deletion systems
Theoretical Computer Science - Descriptional complexity of formal systems
On the size of computationally complete hybrid networks of evolutionary processors
Theoretical Computer Science
Natural Computing: an international journal
Accepting Networks of Genetic Processors are computationally complete
Theoretical Computer Science
| Hi-index | 0.00 |
We discuss the power of networks of evolutionary processors where only two types of nodes are allowed. We prove that (up to an intersection with a monoid) every recursively enumerable language can be generated by a network with one deletion and two insertion nodes. Networks with an arbitrary number of deletion and substitution nodes only produce finite languages, and for each finite language one deletion node or one substitution node is sufficient. Networks with an arbitrary number of insertion and substitution nodes only generate contextsensitive languages, and (up to an intersection with a monoid) every contextsensitive language can be generated by a network with one substitution node and one insertion node.