On spiking neural P systems

Oscar H. Ibarra, Mario J. Pérez-Jiménez, Takashi Yokomori

    研究成果: Article

    5 引用 (Scopus)

    抄録

    This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some variants. A methodology based on the information given by the transition diagram associated with an SN P system is presented. The analysis of the diagram cycles codifies invariants formulae which enable us to establish the soundness and completeness of the system with respect to the problem it tries to resolve. We also study the universality of asynchronous and sequential SN P systems and the capability these models have to generate certain classes of languages. Further, by making a slight modification to the standard SN P systems, we introduce a new variant of SN P systems with a special I/O mode, called SN P modules, and study their computing power. It is demonstrated that, as string language acceptors and transducers, SN P modules can simulate several types of computing devices such as finite automata, a-finite transducers, and systolic trellis automata.

    元の言語English
    ページ(範囲)475-491
    ページ数17
    ジャーナルNatural Computing
    9
    発行部数2
    DOI
    出版物ステータスPublished - 2010 6

    Fingerprint

    Transducers
    Finite automata
    Formal verification

    ASJC Scopus subject areas

    • Computer Science Applications

    これを引用

    On spiking neural P systems. / Ibarra, Oscar H.; Pérez-Jiménez, Mario J.; Yokomori, Takashi.

    :: Natural Computing, 巻 9, 番号 2, 06.2010, p. 475-491.

    研究成果: Article

    Ibarra, OH, Pérez-Jiménez, MJ & Yokomori, T 2010, 'On spiking neural P systems', Natural Computing, 巻. 9, 番号 2, pp. 475-491. https://doi.org/10.1007/s11047-009-9159-3
    Ibarra, Oscar H. ; Pérez-Jiménez, Mario J. ; Yokomori, Takashi. / On spiking neural P systems. :: Natural Computing. 2010 ; 巻 9, 番号 2. pp. 475-491.
    @article{b768d562f9d0401680d93290987c5cbf,
    title = "On spiking neural P systems",
    abstract = "This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some variants. A methodology based on the information given by the transition diagram associated with an SN P system is presented. The analysis of the diagram cycles codifies invariants formulae which enable us to establish the soundness and completeness of the system with respect to the problem it tries to resolve. We also study the universality of asynchronous and sequential SN P systems and the capability these models have to generate certain classes of languages. Further, by making a slight modification to the standard SN P systems, we introduce a new variant of SN P systems with a special I/O mode, called SN P modules, and study their computing power. It is demonstrated that, as string language acceptors and transducers, SN P modules can simulate several types of computing devices such as finite automata, a-finite transducers, and systolic trellis automata.",
    keywords = "Asynchronous, Finite automaton, Finite state transducer, Formal verification, Sequential, Spiking neural P system, Systolic trellis automaton, Universality",
    author = "Ibarra, {Oscar H.} and P{\'e}rez-Jim{\'e}nez, {Mario J.} and Takashi Yokomori",
    year = "2010",
    month = "6",
    doi = "10.1007/s11047-009-9159-3",
    language = "English",
    volume = "9",
    pages = "475--491",
    journal = "Natural Computing",
    issn = "1567-7818",
    publisher = "Springer Netherlands",
    number = "2",

    }

    TY - JOUR

    T1 - On spiking neural P systems

    AU - Ibarra, Oscar H.

    AU - Pérez-Jiménez, Mario J.

    AU - Yokomori, Takashi

    PY - 2010/6

    Y1 - 2010/6

    N2 - This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some variants. A methodology based on the information given by the transition diagram associated with an SN P system is presented. The analysis of the diagram cycles codifies invariants formulae which enable us to establish the soundness and completeness of the system with respect to the problem it tries to resolve. We also study the universality of asynchronous and sequential SN P systems and the capability these models have to generate certain classes of languages. Further, by making a slight modification to the standard SN P systems, we introduce a new variant of SN P systems with a special I/O mode, called SN P modules, and study their computing power. It is demonstrated that, as string language acceptors and transducers, SN P modules can simulate several types of computing devices such as finite automata, a-finite transducers, and systolic trellis automata.

    AB - This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some variants. A methodology based on the information given by the transition diagram associated with an SN P system is presented. The analysis of the diagram cycles codifies invariants formulae which enable us to establish the soundness and completeness of the system with respect to the problem it tries to resolve. We also study the universality of asynchronous and sequential SN P systems and the capability these models have to generate certain classes of languages. Further, by making a slight modification to the standard SN P systems, we introduce a new variant of SN P systems with a special I/O mode, called SN P modules, and study their computing power. It is demonstrated that, as string language acceptors and transducers, SN P modules can simulate several types of computing devices such as finite automata, a-finite transducers, and systolic trellis automata.

    KW - Asynchronous

    KW - Finite automaton

    KW - Finite state transducer

    KW - Formal verification

    KW - Sequential

    KW - Spiking neural P system

    KW - Systolic trellis automaton

    KW - Universality

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

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

    U2 - 10.1007/s11047-009-9159-3

    DO - 10.1007/s11047-009-9159-3

    M3 - Article

    AN - SCOPUS:77955920050

    VL - 9

    SP - 475

    EP - 491

    JO - Natural Computing

    JF - Natural Computing

    SN - 1567-7818

    IS - 2

    ER -