On three variants of rewriting P systems
✍ Scribed by Claudio Ferretti; Giancarlo Mauri; Gheorghe Păun; Claudio Zandron
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 241 KB
- Volume
- 301
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
We continue here the study of P systems with string objects processed by rewriting rules, by investigating some questions which are classic in formal language theory: leftmost derivation, conditional use of rules (permitting and forbidding conditions), relationships with language families in Chomsky and Lindenmayer hierarchies.
📜 SIMILAR VOLUMES
The termination of a confluent one-rule string-rewriting system R = (s + I} is reduced to that of another one-rule system K = {s' -B t') such that s' is self-overlap-free &of). A necessary and sufficient condition is given for termination of a one-rule system R = {s --+ t} such that s is sof and s o