Home

Biblio

Export 723 results:
Sort by: Author Title Type [ Year (Desc)]
Filters: First Letter Of Last Name is P  [Clear All Filters]
2003
Pérez-Jiménez, A. J., Pérez-Jiménez M. J., & Sancho-Caparrini F. (2003).  Formal verification of a transition P system generating the set 2^n+n^2+n:n>=1. (Matteo Cavaliere, Carlos Martín-Vide, Gheorghe Paun, Ed.).First Brainstorming Week on Membrane Computing. 261-269.
Cavaliere, M., Martín-Vide C., & Paun G. (2003).  Proceedings of the Brainstorming Week on Membrane Computing. First Brainstorming Week on Membrane Computing.
Sancho-Caparrini, F., & Pérez-Jiménez M. J. (2003).  Verification of non deterministic transition P systems solving SAT problem . (Matteo Cavaliere, Carlos Martín-Vide, Gheorghe Paun, Ed.).First Brainstorming Week on Membrane Computing. 291-304.
Díaz-Pernil, D., Pérez-Jiménez M. J., & Ramos-Espina A. J. (2003).  Molecular programs as formal systems. (E. Alvarez, R. Bosch, L. Villamil, Ed.).12th International Congress of Logic, Methodology and Philosophy of Science. 160-161.
Pérez-Jiménez, M. J., Romero-Jiménez Á., & Sancho-Caparrini F. (2003).  Complexity Classes in Cellular Computing with Membranes. (Matteo Cavaliere, Carlos Martín-Vide, Gheorghe Paun, Ed.).Brainstorming Week on Membrane Computing. 270-278.
Pérez-Jiménez, M. J., Romero-Jiménez Á., & Sancho-Caparrini F. (2003).  Solving VALIDITY Problem by Active Membranes with Input. (Matteo Cavaliere, Carlos Martín-Vide, Gheorghe Paun, Ed.).Brainstorming Week on Membrane Computing. 279-290.
Pérez-Jiménez, M. J., Romero-Jiménez Á., & Sancho-Caparrini F. (2003).  Complexity Classes in Cellular Computing with Membranes. First Joint Meeting between the RSME and the AMS. 4. Abstract
Pérez-Jiménez, M. J., Romero-Jiménez Á., & Sancho-Caparrini F. (2003).  Complexity Classes in Cellular Computing with Membranes. First Annual Meeting of the European Molecular Computing Consortium. 18.
Pérez-Jiménez, M. J., Romero-Jiménez Á., & Sancho-Caparrini F. (2003).  A Polynomial Complexity Class in P Systems Using Membrane Division. (Erzsebet Csuhaj-Varjú, C. Kintala, D. Wotschke, György Vaszil, Ed.).Fifth International Workshop on Descriptional Complexity of Formal Systems. 284-294.
Obtulowicz, A., & Paun G. (2003).  (In search of) probabilistic P systems . Biosystems. 70(2), 107-121. Abstract
Gheorghe, M., Martín-Vide C., Mitrana V., & Pérez-Jiménez M. J. (2003).  An agent based approach of collective foraging. Lecture Notes in Computer Science. 2686, 638-645. Abstract
Ceterchi, R., Mutyam M., Paun G., & Subramanian K. G. (2003).  Array-rewriting P systems . Natural Computing. 2(3), 229-249. Abstract
Pérez-Jiménez, M. J., Romero-Jiménez Á., & Sancho-Caparrini F. (2003).  Complexity classes in models of cellular computing with membranes. Natural Computing. 2(3), 265 - 285 . Abstract
Pérez-Jiménez, M. J., Romero-Jiménez Á., & Sancho-Caparrini F. (2003).  Decision P systems and the P≠NP conjecture. Lecture Notes in Computer Science. 2597, 388-399. Abstract
Csuhaj-Varjú, E., Martín-Vide C., Paun G., & Salomaa A. (2003).  From Watson-Crick L systems to Darwinian P systems . Natural Computing. 2(3), 299-318. Abstract
Besozzi, D., Mauri G., Paun G., & Zandron C. (2003).  Gemmating P systems: collapsing hierarchies . Theoretical Computer Science. 296(2), 253-267 . Abstract
Martín-Vide, C., Mitrana V., Pérez-Jiménez M. J., & Sancho-Caparrini F. (2003).  Hybrid Networks of Evolutionary Processors. Lecture Notes in Computer Science. 2723, 401-412. Abstract
Pérez-Jiménez, M. J., & Sancho-Caparrini F. (2003).  Máquinas moleculares basadas en ADN. Colección de Divulgación Científica. 2, 255. Abstract
Paun, G., Rozenberg G., Salomaa A., & Zandron C. (2003).  Membrane Computing (International Workshop, WMC-CDEA 2002, Revised Papers). VIII+421.
Paun, G., Rozenberg G., Salomaa A., & Zandron C. (2003).  Membrane Computing, International Workshop, WMC-CdeA 2002, Curtea de Arges, Romania, August 19-23, 2002, Revised Papers. Lecture Notes in Computer Science. 2597,
Balbontín-Noval, D., Pérez-Jiménez M. J., & Sancho-Caparrini F. (2003).  A MzScheme implementation of Transition P systems. Lecture Notes in Computer Science. 2597, 58-73. Abstract
Kelemene, J., Freund R., & Paun G. (2003).  A Note on Emergence in Multi-Agent String Processing Systems. Computing and Informatics. 22(6), 623-637. Abstract
Borrego-Díaz, J., Fernández-Margarit A., & Pérez-Jiménez M. J. (2003).  On Sigma-n definability in Arithmetic.. (A. Rojszczak, J. Cachro, G. Kurczewski, Ed.).Philosophical Dimensions of Logic and Science. 47-56.
Ferretti, C., Mauri G., Paun G., & Zandron C. (2003).  On three variants of rewriting P systems . Theoretical Computer Science. 301(1), 201-215. Abstract
Csuhaj-Varjú, E., Paun G., & Vaszil G. (2003).  PC grammar systems with five context-free components generate all recursively enumerable languages. Theoretical Computer Science. 299(1-3 ), 785 - 794 . Abstract

Statistics

  • Books (11)
  • Edited Books (28)
  • Contributions to Book Chapters (42)
  • Journal Papers (416)
  • Papers in Collective Volumes (0)
  • Technical Reports (3)
  • Conference Contributions (289)
  • Conference Proceedings (37)