From Watson-Crick L systems to Darwinian P systems

摘要: Watson-Crick L systems are language generating devices making use of complementarity, a fundamental concept DNA computing. These Lindenmayer enriched with trigger for complementarity transition: if ``bad'' string is obtained, then the derivation continues its complement which always ``good'' string. Membrane or P distributed parallel computing models were abstracted from structure and way functioning living cells. In this paper, we first interpret results known about computational completeness E0L in terms membrane systems, introduce related controlling evolution by using triggers not operational manner (i.e., turning to configuration), but ``Darwinian'' sense: configuration reached, system ``dies'', that is, no result obtained. The (actually, checkers) given as finite state multiset automata. We investigate power these systems. Their proved, even non-cooperative rules, working non-synchronized way, controlled only two checkers; work synchronized mode, one checker each suffices obtain completeness.