Handbook of Formal Languages
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
Networks of evolutionary processors with subregular filters
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Networks of evolutionary processors: computationally complete normal forms
Natural Computing: an international journal
Hi-index | 0.00 |
In this paper, we study networks of evolutionary processors where the filters are chosen as special regular sets. We consider networks where all the filters belong to a set of languages that are accepted by deterministic finite automata with a fixed number of states. We show that if the number of states is bounded by two, then every recursively enumerable language can be generated by such a network. If the number of states is bounded by one, then not all regular languages but non-context-free languages can be generated.