Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: language generating networks

Sortuj według:

Ogranicz wyniki do:

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

Dassow J., Truthe B.

Fundamenta Informaticae

2011

Vol. 112, nr 2/3

157-170

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.