On networks of evolutionary processors with filters accepted by two-state-automata (Q2882388)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On networks of evolutionary processors with filters accepted by two-state-automata |
scientific article; zbMATH DE number 6030476
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On networks of evolutionary processors with filters accepted by two-state-automata |
scientific article; zbMATH DE number 6030476 |
Statements
4 May 2012
0 references
evolutionary processors
0 references
language generating networks
0 references
state complexity
0 references
On networks of evolutionary processors with filters accepted by two-state-automata (English)
0 references
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.
0 references
