Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.3233/FI-2011-585 | Fundam. Inform. |
Keywords | Field | DocType |
recursively enumerable language,deterministic finite automaton,fixed number,evolutionary processors,non-context-free language,evolutionary processor,special regular set,regular language | Discrete mathematics,Regular sets,Deterministic finite automaton,Automaton,State complexity,Recursively enumerable language,Theoretical computer science,Regular language,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
112 | 2-3 | 0169-2968 |
Citations | PageRank | References |
6 | 0.49 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jürgen Dassow | 1 | 530 | 118.27 |
| Bianca Truthe | 2 | 159 | 28.57 |