Tissue P systems with Symport/Antiport rules of one symbol are computationally complete
暂无分享,去创建一个
[1] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .
[2] Gheorghe Paun,et al. Computing with Membranes: An Introduction , 1999, Bull. EATCS.
[3] Gheorghe Paun,et al. Computing with Membranes , 2000, J. Comput. Syst. Sci..
[4] Rudolf Freund,et al. P Systems with Activated/Prohibited Membrane Channels , 2002, WMC-CdeA.
[5] Rudolf Freund,et al. Membrane Systems with Symport/Antiport Rules: Universality Results , 2002, WMC-CdeA.
[6] Alfonso Rodríguez-Patón,et al. Tissue P systems , 2003, Theor. Comput. Sci..
[7] Rudolf Freund,et al. Tissue-like P Systems with Channel-States , 2004 .
[8] Gheorghe Paun,et al. Symport/Antiport P Systems with Three Objects Are Universal , 2004, Fundam. Informaticae.