Author： Ionescu Mihai Martín-Vide Carlos Păun Andrei Păun Gheorghe
Publisher： Springer Publishing Company
ISSN： 1567-7818
Source： Natural Computing, Vol.2, Iss.4, 2003-01, pp. : 337-348
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
P systems with symport/antiport simulating counter automata
By Frisco Pierluigi Hoogeboom Hendrik
Acta Informatica, Vol. 41, Iss. 2-3, 2004-12 ,pp. :
Access to resources
Recommend
On the universality of Post and splicing systems
By Ferretti C. Mauri G. Kobayashi S. Yokomori T.
Theoretical Computer Science, Vol. 231, Iss. 2, 2000-01 ,pp. :
On three variants of rewriting P systems
By Ferretti C. Mauri G. Paun G. Zandron C.
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
DNA computing based on splicing: universality results
By Paun G.
Theoretical Computer Science, Vol. 231, Iss. 2, 2000-01 ,pp. :
Reducibility classes of P-selective sets
By Hemaspaandra L.A. Hoene A. Ogihara M.
Theoretical Computer Science, Vol. 155, Iss. 2, 1996-03 ,pp. :