Results 1 
2 of
2
Păun: Universal P Systems: One Catalyst Can Be Sufficient
 Proc. 11th Brainstorming Week on Membrane Computing
"... Summary. Whether P systems with only one catalyst can already be universal, is still an open problem. Here we establish universality (computational completeness) by using specific variants of additional control mechanisms. At each step using only multiset rules from one set of a finite number of set ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Summary. Whether P systems with only one catalyst can already be universal, is still an open problem. Here we establish universality (computational completeness) by using specific variants of additional control mechanisms. At each step using only multiset rules from one set of a finite number of sets of rules allows for obtaining computational completeness with one catalyst and only one membrane. If the targets are used for choosing the multiset of rules to be applied, for getting computational completeness with only one catalyst more than one membrane is needed. If the available sets of rules change periodically with time, computational completeness can be obtained with one catalyst in one membrane. Moreover, we also improve existing computational completeness results for P systems with mobile catalysts and for P systems with membrane creation. 1
A Formal System for Defining the Syntax and Semantics of Computer Languages
, 1969
"... The thesis of this dissertation is that formal definitions of the syntax and semantics of computer languages are needed. This dissertation investigates two candidates for formally defining computer languages: (1) the formalism of canonical systems for defining the syntax of a computer language and i ..."
Abstract
 Add to MetaCart
The thesis of this dissertation is that formal definitions of the syntax and semantics of computer languages are needed. This dissertation investigates two candidates for formally defining computer languages: (1) the formalism of canonical systems for defining the syntax of a computer language and its translation into a target language, and (2) the formalisms of the lcalculus and extended Markov algorithms as a combined formalism used as the basis of a target language for defining the semantics of a computer language.