P automata or purely communicating accepting P systems

Erzsébet Csuhaj-Varjú, György Vaszil

Research output: Contribution to journalArticle

58 Citations (Scopus)

Abstract

In this paper we introduce the notion of a P automaton with one-way communication, a concept related both to P systems and the traditional concept of automata. A P automaton with one-way communication is a purely communicating accepting P system. The result of the computation in these systems is the set of multiset sequences consumed by the skin membrane, supposing that the P automaton started functioning in an initial state and entered a so-called final state. As a result, we show that for any recursively enumerable language, a P automaton and a certain type of projection can be constructed such that the given language is obtained as the image of the set of accepted input multiset sequences of the P automaton.

Original languageEnglish
Pages (from-to)219-233
Number of pages15
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2597
Publication statusPublished - Dec 1 2003

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this