Results 1  10
of
1,920,531
About P systems with symport/antiport
 Second Brainstorming Week on Membrane Computing
, 2004
"... Abstract. It is proved that four membranes suffice to P systems with minimal symport/antiport to generate all recursively enumerable sets of numbers. It is also proved that P systems with symport/antiport without maximal parallelism are equivalent to partially blind counter automata. 1 ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. It is proved that four membranes suffice to P systems with minimal symport/antiport to generate all recursively enumerable sets of numbers. It is also proved that P systems with symport/antiport without maximal parallelism are equivalent to partially blind counter automata. 1
Small Computationally Complete Symport/Antiport P Systems
 IN PROCEEDINGS OF THE FOURTH BRAINSTORMING WEEK ON MEMBRANE COMPUTING
, 2006
"... It is known that P systems with symport/antiport rules simulate the register machines, i.e., they are computationally complete. Hence, due to the existence of universal register machines, there exist computationally complete subclasses of symport/antiport P systems with a number of rules limited b ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
It is known that P systems with symport/antiport rules simulate the register machines, i.e., they are computationally complete. Hence, due to the existence of universal register machines, there exist computationally complete subclasses of symport/antiport P systems with a number of rules limited
D.: P Systems with Symport/Antiport of Rules
"... Abstract. Moving “instructions ” instead of “data”, using transport mechanisms inspired by biology – this could represent, shortly, the basic idea of the computing device presented in this paper. Specifically, we propose a new class of P systems that use, at the same time, evolution rules and sympor ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
and symport/antiport rules. The idea of this kind of systems is simple: during a computation symbolobjects (the “data”) evolve using evolution rules but they cannot be moved; on the other hand, the evolution rules (the “instructions”) can be moved across the membranes using classical symport/antiport rules
Symbol/membrane complexity of P systems with symport/antiport
 PreProceedings of the 6th International Workshop on Membrane Computing (WMC6
"... Summary. We consider P systems with symport / antiport rules and small numbers of symbols and membranes and present several results for P systems with symport / antiport rules simulating register machines with the number of registers depending on the number s of symbols and the number m of membranes ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
to generate/accept any recursively enumerable set of kdimensional vectors of nonnegative integers or to compute any partial recursive function f: N α → N β. Finally, we also study the computational power of P systems with symport / antiport rules and only one symbol: with one membrane, we can exactly
P Systems with Symport/Antiport of Rules, in the present volume
"... Abstract: Moving “instructions ” instead of “data ” using transport mechanisms inspired by biology is the basic idea of the computing device presented in this paper. Specifically, we propose a new class of P systems that use both evolution rules and symport/antiport rules. The idea of this kind of s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: Moving “instructions ” instead of “data ” using transport mechanisms inspired by biology is the basic idea of the computing device presented in this paper. Specifically, we propose a new class of P systems that use both evolution rules and symport/antiport rules. The idea of this kind
Small universal tissue P systems with symport/antiport rules
 Int J Comput Commun, ISSN
, 2012
"... In this note, we consider the problem of looking for small universal onesymbol tissue P systems with symport/antiport rules. It is proved that six cells suffice to generate any recursively enumerable set of natural numbers by such a onesymbol tissue P system with symport/antiport rules, under the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this note, we consider the problem of looking for small universal onesymbol tissue P systems with symport/antiport rules. It is proved that six cells suffice to generate any recursively enumerable set of natural numbers by such a onesymbol tissue P system with symport/antiport rules, under
Rogozhin: Generating Languages by P Systems with Minimal Symport/Antiport
 Computer Science Journal of Moldova
, 2006
"... It is known that P systems with two membranes and minimal symport/antiport rules are “almost ” computationally complete as generators of number or vector sets. Interpreting the result of the computation as the sequence of terminal symbols sent to the environment, we show that P systems with two memb ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
It is known that P systems with two membranes and minimal symport/antiport rules are “almost ” computationally complete as generators of number or vector sets. Interpreting the result of the computation as the sequence of terminal symbols sent to the environment, we show that P systems with two
New Choice for Small Universal Devices: Symport/Antiport P Systems
, 906
"... Symport/antiport P systems provide a very simple machinery inspired by corresponding operations in the living cell. It turns out that systems of small descriptional complexity are needed to achieve the universality by these systems. This makes them a good candidate for small universal devices replac ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Symport/antiport P systems provide a very simple machinery inspired by corresponding operations in the living cell. It turns out that systems of small descriptional complexity are needed to achieve the universality by these systems. This makes them a good candidate for small universal devices
LowPower CMOS Digital Design
 JOURNAL OF SOLIDSTATE CIRCUITS. VOL 27, NO 4. APRIL 1992 413
, 1992
"... Motivated by emerging batteryoperated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput. Techniques for lowpower operation are shown which use the ..."
Abstract

Cited by 570 (20 self)
 Add to MetaCart
Motivated by emerging batteryoperated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput. Techniques for lowpower operation are shown which use
Results 1  10
of
1,920,531