Promoters and Inhibitors in Purely Catalytic P Systems
暂无分享,去创建一个
[1] Rudolf Freund,et al. Flattening in (Tissue) P Systems , 2013, Int. Conf. on Membrane Computing.
[2] Artiom Alhazov,et al. Ultimately Confluent Rewriting Systems. Parallel Multiset-Rewriting with Permitting or Forbidding Contexts , 2004, Workshop on Membrane Computing.
[3] Rudolf Freund,et al. A Formal Framework for Static (Tissue) P Systems , 2007, Workshop on Membrane Computing.
[4] Artiom Alhazov,et al. Asynchronous and Maximally Parallel Deterministic Controlled Non-cooperative P Systems Characterize NFIN and coNFIN , 2012, Int. Conf. on Membrane Computing.
[5] Erzsébet Csuhaj-Varjú,et al. P Automata or Purely Communicating Accepting P Systems , 2002, WMC-CdeA.
[6] Gheorghe Paun,et al. The Oxford Handbook of Membrane Computing , 2010 .
[7] Oscar H. Ibarra,et al. Deterministic catalytic systems are not universal , 2006, Theor. Comput. Sci..
[8] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.
[9] Rudolf Freund,et al. A General Framework for Regulated Rewriting Based on the Applicability of Rules , 2011, Computation, Cooperation, and Life.
[10] Mihai Ionescu,et al. On P Systems with Promoters/Inhibitors , 2004, J. Univers. Comput. Sci..
[11] Rudolf Freund,et al. How to Obtain Computational Completeness in P Systems with One Catalyst , 2013, MCU.
[12] Dragos Sburlan. Further results on P systems with promoters/inhibitors , 2006, Int. J. Found. Comput. Sci..
[13] Rudolf Freund,et al. Computationally universal P systems without priorities: two catalysts are sufficient , 2005, Theor. Comput. Sci..
[14] Jozef Kelemen,et al. Computation, Cooperation, and Life - Essays Dedicated to Gheorghe Paun on the Occasion of His 60th Birthday , 2011, Computation, Cooperation, and Life.
[15] Artiom Alhazov,et al. Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems , 2014, Int. Conf. on Membrane Computing.
[16] Gheorghe Paun,et al. Membrane Computing , 2002, Natural Computing Series.