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
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
State complexity of basic operations on suffix-free regular languages
Theoretical Computer Science
On Networks of Evolutionary Processors with Nodes of Two Types
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Determination of finite automata accepting subregular languages
Theoretical Computer Science
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Quotient complexity of ideal languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
On external contextual grammars with subregular selection languages
Theoretical Computer Science
On union-free and deterministic union-free languages
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Networks of evolutionary processors: computationally complete normal forms
Natural Computing: an international journal
Hi-index | 0.00 |
In this paper we propose a hierarchy of classes of languages, generated by networks of evolutionary processors with the filters in several special classes of regular sets. More precisely, we show that the use of filters from the class of ordered, non-counting, power-separating, circular, suffix-closed regular, union-free, definite and combinational languages is as powerful as the use of arbitrary regular languages and yields networks that can generate all the recursively enumerable languages. On the other hand, the use of filters that are only finite languages allows only the generation of regular languages, but not all regular languages can be generated. If we use filters that are monoids, nilpotent languages or commutative regular languages, we obtain the same family of languages which contains non-context-free languages but not all regular languages. These results seem to be of interest because they provide both upper and lower bounds on the classes of languages that one can use as filters in a network of evolutionary processor in order to obtain a complete computational model.