A Look Back at Some Early Results in Membrane Computing
暂无分享,去创建一个
[1] Rudolf Freund,et al. Computationally universal P systems without priorities: two catalysts are sufficient , 2005, Theor. Comput. Sci..
[2] David I. Lewin,et al. DNA computing , 2002, Comput. Sci. Eng..
[3] Gheorghe Paun. Further Twenty Six Open Problems in Membrane Computing , 2005 .
[4] Gheorghe Paun,et al. Computing with Membranes , 2000, J. Comput. Syst. Sci..
[5] Oscar H. Ibarra,et al. Deterministic catalytic systems are not universal , 2006, Theor. Comput. Sci..
[6] Andrei Paun,et al. The power of communication: P systems with symport/antiport , 2002, New Generation Computing.
[7] Rudolf Freund,et al. Special Variants of P Systems Inducing an Infinite Hierarchy with Respect to the Number of Membranes , 2001, Bull. EATCS.
[8] Gheorghe Păun,et al. Computing with cells and atoms in a nutshells , 2000 .
[9] Oscar H. Ibarra,et al. Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems , 2006, Theor. Comput. Sci..
[10] Oscar H. Ibarra,et al. On various notions of parallelism in P Systems , 2005, Int. J. Found. Comput. Sci..
[11] Oscar H. Ibarra. On membrane hierarchy in P systems , 2005, Theor. Comput. Sci..
[12] Oscar H. Ibarra. On determinism versus nondeterminism in P systems , 2005, Theor. Comput. Sci..
[13] Gheorghe Paun,et al. Membrane Computing , 2002, Natural Computing Series.
[14] Oscar H. Ibarra,et al. On Bounded Symport/Antiport P Systems , 2005, DNA.
[15] Cristian S. Calude,et al. Computing with Cells and Atoms: After Five Years , 2004 .