On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata

  • Authors:
  • Jürgen Dassow;Bianca Truthe

  • Affiliations:
  • (Correspd.) Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, PSF 4120, D-39016 Magdeburg, Germany. {dassow,truthe}@iws.cs.uni-magdeburg.de;Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, PSF 4120, D-39016 Magdeburg, Germany. {dassow,truthe}@iws.cs.uni-magdeburg.de

  • Venue:
  • Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.