Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-07T14:41:58.399Z Has data issue: false hasContentIssue false
  • English
  • Français

Efficient computation in rational-valued P systems

Published online by Cambridge University Press:  04 December 2009

NADIA BUSI ,
MIGUEL A. GUTIÉRREZ-NARANJO  and
MARIO J. PÉREZ-JIMÉNEZ
NADIA BUSI
Affiliation:
Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Spain Email: magutier@us.es, marper@us.es
MIGUEL A. GUTIÉRREZ-NARANJO
Affiliation:
Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Spain Email: magutier@us.es, marper@us.es
MARIO J. PÉREZ-JIMÉNEZ
Affiliation:
Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Spain Email: magutier@us.es, marper@us.es
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper, we describe a new representation for deterministic rational-valued P systems that allows us to form a bridge between membrane computing and linear algebra. On the one hand, we prove that an efficient computation for these P systems can be described using linear algebra techniques. In particular, we show that the computation for getting a configuration in such P systems can be carried out by multiplying appropriate matrices. On the other hand, we also show that membrane computing techniques can be used to get the nth power of a given matrix.

Information

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 19 , Special Issue 6: Dedicated to Nadia Busi , December 2009 , pp. 1125 - 1139
Copyright
Copyright © Cambridge University Press 2009

References

Ciobanu, G., Păun, Gh. and Pérez-Jiménez, M. J. (eds.) (2006) Applications of Membrane Computing, Springer-Verlag.Google Scholar
Coppersmith, D. and Winograd, S. (1990) Matrix multiplication via arithmetic progressions. Journal of Synbolic Computation 9 251–280.CrossRefGoogle Scholar
Cordón-Franco, A., Gutiérrez-Naranjo, M. A., Pérez-Jiménez, M. J. and Riscos-Núnez, A. (2005) Exploring Computation Trees Associated with P Systems. In: Membrane Computing. Springer-Verlag Lecture Notes in Computer Science 3365 278–286.CrossRefGoogle Scholar
Gutiérrez-Naranjo, M. A., Pérez-Jiménez, M. J., Riscos-Núnez, A. and Romero-Campero, F. J. (2005) P Systems with Active Membranes, without Polarizations and with Dissolution: A Characterization of P. In: Unconventional Computation. Springer-Verlag Lecture Notes in Computer Science 3699 105–116.Google Scholar
Gutiérrez-Naranjo, M. A., Pérez-Jiménez, M. J., Riscos-Núnez, A. and Romero-Campero, F. J. (2006) On the Power of Dissolution in P Systems with Active Membranes. In: Membrane Computing. Springer-Verlag Lecture Notes in Computer Science 3850 224–240.Google Scholar
Horn, R. A. and Johnson, C. R. (1985) Matrix Analysis, Cambridge University Press.Google Scholar
Păun, Gh. (2000) Computing with membranes. Journal of Computer and System Sciences 61 (1)108–143.Google Scholar