DMCA
Deterministic catalytic systems are not universal
| Venue: | Theoretical Computer Science 363 |
| Citations: | 5 - 1 self |
BibTeX
@INPROCEEDINGS{Ibarra_deterministiccatalytic,
author = {Oscar H. Ibarra and Hsu-chun Yen},
title = {Deterministic catalytic systems are not universal},
booktitle = {Theoretical Computer Science 363},
year = {},
pages = {149--161}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We look at a 1-membrane catalytic P system with evolution rules of the form Ca → Cv or a → v, where C is a catalyst, a is a noncatalyst symbol, and v is a (possibly null) string representing a multiset of noncatalyst symbols. (Note that we are only interested in the multiplicities of the symbols.) A catalytic system can be regarded as a language acceptor in the following sense. Given an input alphabet Σ consisting of noncatalyst symbols, the system starts with an initial configuration wz, where w is a fixed string of catalysts and noncatalysts not containing any symbol in z, and z = a n1 1...ank k for some nonnegative integers n1,..., nk, with {a1,..., ak} ⊆ Σ. At each step, a maximal multiset of rules is nondeterministically selected and applied in parallel to the current configuration to derive the next configuration (note that the next configuration is not unique, in general). The string z is accepted if the
