Deterministic catalytic systems are not universal
type: Item
instance of: scholarly article
title: Deterministic catalytic systems are not universal
zbMATH Open document ID: 1153.68019
author: Oscar H. Ibarra
author: Hsu-Chun Yen
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5083506
zbMATH Keywords: membrane computing
zbMATH Keywords: deterministic catalytic system
zbMATH Keywords: deterministic versus nondeterministic
zbMATH Keywords: symport/antiport system
zbMATH Keywords: counter machine
zbMATH Keywords: semilinear set
zbMATH Keywords: priority
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.07.029
OpenAlex ID: W1964420136
cites work: On the analysis of Petri nets with static priorities
cites work: Computationally universal P systems without priorities: Two catalysts are sufficient
cites work: Q5576254
cites work: Developments in Language Theory
cites work: The power of communication: P systems with symport/antiport
cites work: Computing with membranes
cites work: Membrane computing. An introduction.
cites work: A guide to membrane computing.
DOI: 10.1016/J.TCS.2006.07.029
description: scientific article; zbMATH DE number 5083506