Home

Biblio

Export 209 results:
Sort by: Author Title Type [ Year (Desc)]
Filters: First Letter Of Last Name is S  [Clear All Filters]
2004
Paun, G., Pérez-Jiménez M. J., & Sancho-Caparrini F. (2004).  On the Reachability Problem for P Systems With Symport/Antiport. Publicationes Mathematicae Debrecen. 65, 603-627.
Pérez-Jiménez, M. J., Romero-Jiménez Á., & Sancho-Caparrini F. (2004).  The P Versus NP Problem Through Cellular Computing with Membranes. Lecture Notes in Computer Science. 2950, 338-352. Abstract
2003
Pérez-Jiménez, A. J., Pérez-Jiménez M. J., & Sancho-Caparrini F. (2003).  Computing a Partial Mapping by a P System: Design and Verification. (Matteo Cavaliere, Carlos Martín-Vide, Gheorghe Paun, Ed.).First Brainstorming Week on Membrane Computing . 247-260.
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.
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.
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.
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
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
2002
Paun, G., Pérez-Jiménez M. J., & Sancho-Caparrini F. (2002).  On the Reachability Problem for P System with Porters. 10th International Conference on Automata and Formal Languages. 1-3.
Martín-Mateos, F. J., Pérez-Jiménez M. J., & Sancho-Caparrini F. (2002).  Molecular Computation Models in ACL2: A Simulation of Lipton's SAT Experiment in the Adleman's Restricted Model. Third International Workshop on the ACL2 Theorem Prover and its Applications. 175-187.
Pérez-Jiménez, M. J., Sancho-Caparrini F., Graciani-Díaz C., & Romero-Jiménez Á. (2002).  Formalización computacional del experimento de Lipton sobre el problema SAT. Primer Congreso Español de Algoritmos Evolutivos y Bioinspirados. 326-332.
Pérez-Jiménez, M. J., & Sancho-Caparrini F. (2002).  Solving Knapsack Problems in a Sticker Based Model . Lecture Notes in Computer Science. 2340, 161-171. Abstract
Pérez-Jiménez, M. J., & Sancho-Caparrini F. (2002).  Computación Celular con Membranas: Un Modelo no Convencional . II+107.
Pérez-Jiménez, M. J., & Sancho-Caparrini F. (2002).  A Formalization of Transition P Systems. Fundamenta Informaticae. 49(1-3), 261-272. Abstract

Statistics

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