Simulating H systems by P systems

Gheorghe Pǎun, Takashi Yokomori

    Research output: Contribution to journalArticle

    7 Citations (Scopus)

    Abstract

    H systems are DNA computing models, based on the operation of splicing. P systems are membrane computing models, where objects can evolve in parallel in a hierarchical membrane structure. In particular, the objects can be strings and the evolution rules can be based on splicing. Both H systems with certain controls on the use of splicing rules and P systems of various types are known to be computationally universal, that is, they characterize the recursively ennumerable languages. So, they are equivalent as the generative power. The present paper presents a direct simulation of some controlled H systems by splicing P systems. We achieve this goal for three basic regulation mechanisms: H systems with permitting contexts, H systems with forbidding contexts, and communicating distributed H systems. We can say that in this way we get a uniform "implementation" of the three types of H systems in the form of a "computing cell".

    Original languageEnglish
    Pages (from-to)178-193
    Number of pages16
    JournalJournal of Universal Computer Science
    Volume6
    Issue number1
    Publication statusPublished - 2000

    Fingerprint

    P Systems
    Membrane structures
    DNA
    Membranes
    Membrane Computing
    DNA Computing
    Membrane
    Strings
    Model-based
    Computing
    Cell

    Keywords

    • H systems
    • Splicing rule
    • Universal models of computation

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Simulating H systems by P systems. / Pǎun, Gheorghe; Yokomori, Takashi.

    In: Journal of Universal Computer Science, Vol. 6, No. 1, 2000, p. 178-193.

    Research output: Contribution to journalArticle

    Pǎun, Gheorghe ; Yokomori, Takashi. / Simulating H systems by P systems. In: Journal of Universal Computer Science. 2000 ; Vol. 6, No. 1. pp. 178-193.
    @article{4d6beef7825e417492aaf41cdd0c0c20,
    title = "Simulating H systems by P systems",
    abstract = "H systems are DNA computing models, based on the operation of splicing. P systems are membrane computing models, where objects can evolve in parallel in a hierarchical membrane structure. In particular, the objects can be strings and the evolution rules can be based on splicing. Both H systems with certain controls on the use of splicing rules and P systems of various types are known to be computationally universal, that is, they characterize the recursively ennumerable languages. So, they are equivalent as the generative power. The present paper presents a direct simulation of some controlled H systems by splicing P systems. We achieve this goal for three basic regulation mechanisms: H systems with permitting contexts, H systems with forbidding contexts, and communicating distributed H systems. We can say that in this way we get a uniform {"}implementation{"} of the three types of H systems in the form of a {"}computing cell{"}.",
    keywords = "H systems, Splicing rule, Universal models of computation",
    author = "Gheorghe Pǎun and Takashi Yokomori",
    year = "2000",
    language = "English",
    volume = "6",
    pages = "178--193",
    journal = "Journal of Universal Computer Science",
    issn = "0948-695X",
    publisher = "Springer Verlag",
    number = "1",

    }

    TY - JOUR

    T1 - Simulating H systems by P systems

    AU - Pǎun, Gheorghe

    AU - Yokomori, Takashi

    PY - 2000

    Y1 - 2000

    N2 - H systems are DNA computing models, based on the operation of splicing. P systems are membrane computing models, where objects can evolve in parallel in a hierarchical membrane structure. In particular, the objects can be strings and the evolution rules can be based on splicing. Both H systems with certain controls on the use of splicing rules and P systems of various types are known to be computationally universal, that is, they characterize the recursively ennumerable languages. So, they are equivalent as the generative power. The present paper presents a direct simulation of some controlled H systems by splicing P systems. We achieve this goal for three basic regulation mechanisms: H systems with permitting contexts, H systems with forbidding contexts, and communicating distributed H systems. We can say that in this way we get a uniform "implementation" of the three types of H systems in the form of a "computing cell".

    AB - H systems are DNA computing models, based on the operation of splicing. P systems are membrane computing models, where objects can evolve in parallel in a hierarchical membrane structure. In particular, the objects can be strings and the evolution rules can be based on splicing. Both H systems with certain controls on the use of splicing rules and P systems of various types are known to be computationally universal, that is, they characterize the recursively ennumerable languages. So, they are equivalent as the generative power. The present paper presents a direct simulation of some controlled H systems by splicing P systems. We achieve this goal for three basic regulation mechanisms: H systems with permitting contexts, H systems with forbidding contexts, and communicating distributed H systems. We can say that in this way we get a uniform "implementation" of the three types of H systems in the form of a "computing cell".

    KW - H systems

    KW - Splicing rule

    KW - Universal models of computation

    UR - http://www.scopus.com/inward/record.url?scp=0000911768&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0000911768&partnerID=8YFLogxK

    M3 - Article

    AN - SCOPUS:0000911768

    VL - 6

    SP - 178

    EP - 193

    JO - Journal of Universal Computer Science

    JF - Journal of Universal Computer Science

    SN - 0948-695X

    IS - 1

    ER -