On the computational complexity of membrane systems

We show how techniques in machine-based complexity can be used to analyze the complexity of membrane computing systems. We focus on catalytic systems, communicating P systems, and systems with only symport/antiport rules, but our techniques are applicable to other P systems that are universal. We de...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 320; no. 1; pp. 89 - 109
Main Author:	Ibarra, Oscar H.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 12.06.2004 Elsevier
Subjects:	Acceptor Applied sciences Catalytic system Combinatorics Combinatorics. Ordered structures Communicating P system Computer science; control theory; systems Designs and configurations Exact sciences and technology Generator Mathematics Membrane computing Miscellaneous Reachability Sciences and techniques of general use Semilinear Space bounded Symport/antiport system Theoretical computing Time bounded Symport/antiport system Acceptor Semilinear Catalytic system Time bounded Membrane computing Communicating P system Space bounded Reachability Generator Complexity class Computer theory Turing machine Space time Language generator Complexity measure Computing Computational complexity Polynomial time Hierarchy Membrane Deterministic system Catalysis
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!