P automata or purely communicating accepting P systems

E. Csuhaj-Varjú, György Vaszil

Research output: Article

57 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 - 2003

Fingerprint

P Systems
Automata
Language
Communication
Skin
Multiset
Membranes
Recursively Enumerable Languages
Membrane
Projection

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{6df2030ce8f244979029714eb5606694,
title = "P automata or purely communicating accepting P systems",
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.",
author = "E. Csuhaj-Varj{\'u} and Gy{\"o}rgy Vaszil",
year = "2003",
language = "English",
volume = "2597",
pages = "219--233",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - P automata or purely communicating accepting P systems

AU - Csuhaj-Varjú, E.

AU - Vaszil, György

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

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

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

M3 - Article

AN - SCOPUS:33645599558

VL - 2597

SP - 219

EP - 233

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -