On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata
暂无分享,去创建一个
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.
[1] Artiom Alhazov,et al. On Networks of Evolutionary Processors with Nodes of Two Types , 2009, Fundam. Informaticae.
[2] Victor Mitrana,et al. Networks of evolutionary processors , 2003, Acta Informatica.
[3] Victor Mitrana,et al. Solving NP-Complete Problems With Networks of Evolutionary Processors , 2001, IWANN.
[4] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.