On networks of evolutionary processors with filters accepted by two-state-automata
type: Item
instance of: scholarly article
zbMATH Open document ID: 1263.68098
author: Bianca Truthe
author: Jürgen Dassow
publication date: 2012-05-04T00:00:00Z
full work available at URL: fulltext.html
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 6030476
zbMATH Keywords: evolutionary processors
zbMATH Keywords: language generating networks
zbMATH Keywords: state complexity
MaRDI profile type: Publication
title: On networks of evolutionary processors with filters accepted by two-state-automata
published in: Fundamenta Informaticae
review text: 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.
reviewed by: Anna Labella
description: scientific article; zbMATH DE number 6030476