Approximating non-discrete p systems

Authors:
Andrés Cordón-Franco;Fernando Sancho-Caparrini
Affiliations:
Dpt. Computer Science and Artificial Intelligence, E.T.S.Ingeniería Informática, University of Seville, Spain;Dpt. Computer Science and Artificial Intelligence, E.T.S.Ingeniería Informática, University of Seville, Spain
Venue:
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Year:
2004

Citing 4
Cited 1

Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Simulations of photosynthesis by a K-Subset transforming system with membrane

Fundamenta Informaticae - Membrane computing
A formalization of transition P Systems

Fundamenta Informaticae - Membrane computing

A study of the robustness of the EGFR signalling cascade using continuous membrane systems

IWINAC'05 Proceedings of the First international conference on Mechanisms, Symbols, and Models Underlying Cognition: interplay between natural and artificial computation - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main goal of this paper is to propose some geometric approaches to the computations of non-discrete P systems. The behavior of this kind of P systems is similar to that of classic systems, with the difference that the contents of the membranes are represented by non-discrete multisets (the multiplicities can be non-integers) and, consequently, also the number of applications of a rule in a transition step can be non-integer.