On networks of evolutionary processors with filters accepted by two-state-automata
The paper studies networks of evolutionary processors where the filters are chosen as special regular sets. The authors 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. Improving a previous paper by the same authors, the paper shows 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.
scientific article; zbMATH DE number 6030476