Home

Biblio

Export 209 results:
Sort by: Author Title Type [ Year (Asc)]
Filters: First Letter Of Last Name is S  [Clear All Filters]
2000
Graciani-Díaz, C., Pérez-Jiménez M. J., Romero-Jiménez Á., & Sancho-Caparrini F. (2000).  NP-Completitud y Computación ADN. (Emilio Briales-Morales, Alfonso Carriazo-Rubio, Tomás Chacón-Rebollo, Pedro Real, Álvaro Romero-Jiménez, Ed.).Encuentro de Matemáticos Andaluces. II, 539-548.
Pérez-Jiménez, M. J., Graciani-Díaz C., Romero-Jiménez Á., & Sancho-Caparrini F. (2000).  Soluciones moleculares del problema SAT de la Lógica Proposicional. (Ángel Nepomuceno, José F. Quesada, Francisco J. Salguero, Ed.).Primeras Jornadas sobre Lógica y Lenguaje. 243-252.
2001
Graciani-Díaz, C., Pérez-Jiménez M. J., Romero-Jiménez Á., & Sancho-Caparrini F. (2001).  Initial segments maximal Σₙ-definable sets in fragments of arithmetic. Joint Conference of the 5th Barcelona Logic Meeting and the 6th Kurt Gödel Colloquium. IV, 37-38.
2002
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
Paun, G., Santean N., Thierrin G., & Yu S. (2002).  On the robustness of primitive words . Computación y Sistemas. Revista Iberoamericana de Inteligencia Artificial. 117(1,15), 239-252. Abstract
Paun, G., Sakakibara Y., & Yokomori T. (2002).  P systems on graphs of restricted forms. Publicationes Mathematicae Debrecen. 60, 635-660.
Pérez-Jiménez, M. J., Romero-Jiménez Á., & Sancho-Caparrini F. (2002).  Teoría de la Complejidad en Modelos de Computación Celular con Membranas. II+118 pages.
Amos, M., Paun G., Rozenberg G., & Salomaa A. (2002).  Topics in the theory of DNA computing. Theoretical Computer Science. 287(1), 3 - 38 . Abstract
Amos, M., Paun G., Rozenberg G., & Salomaa A. (2002).  Topics in the theory of DNA computing. Theoretical Computer Science. 287(1), 3 - 38 . Abstract
Pérez-Jiménez, M. J., & Sancho-Caparrini F. (2002).  Verifying a P system generating squares. Romanian Journal of Information Science and Technology. 5(1-2), 181-191.
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., 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.
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.
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.
2003
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
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.

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)