DNA computing based on splicing: universality results

By Paun G.  

Theoretical Computer Science, Vol. 231, Iss. 2, 2000-01 ,pp. : 275-296

Elsevier

Access to resources Recommend Favorite

Multiple splicing systems and the universal computability

By Kobayashi S.   Sakakibara Y.  

Theoretical Computer Science, Vol. 264, Iss. 1, 2001-08 ,pp. : 3-23

Elsevier

Access to resources Recommend Favorite

Unexpected universality results for three classes of P systems with symport/antiport

By Ionescu Mihai   Martín-Vide Carlos   Păun Andrei   Păun Gheorghe  

Natural Computing, Vol. 2, Iss. 4, 2003-01 ,pp. : 337-348

Springer Publishing Company

Access to resources Recommend Favorite

Simplicity, Consistency, Universality, Flexibility and Familiarity: The SCUFF Principles for Developing User Interfaces for Ambient Computer Systems

By  

International Journal of Ambient Computing and Intelligence (IJACI), Vol. 2, Iss. 3, 2010-07 ,pp. : 40-49

IGI Global_journal

Access to resources Recommend Favorite

Computing by splicing

By Paun G.   Rozenberg G.   Salomaa A.  

Theoretical Computer Science, Vol. 168, Iss. 2, 1996-11 ,pp. : 321-336

Elsevier

Access to resources Recommend Favorite