Membrane Systems with Symport/Antiport Rules: Universality Results
暂无分享,去创建一个
[1] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .
[2] Andrei Paun,et al. Computing by Communication in Networks of Membranes , 2002, Int. J. Found. Comput. Sci..
[3] Andrei Paun,et al. On the Power of P Systems with Symport Rules , 2002, J. Univers. Comput. Sci..
[4] Petr Sos ´ ik. Membrane Computing: When Communication Is Enough , 2002 .
[5] Hendrik Jan Hoogeboom,et al. Simulating Counter Automata by P Systems with Symport/Antiport , 2002, WMC-CdeA.
[6] Gheorghe Paun,et al. Computing with Membranes: An Introduction , 1999, Bull. EATCS.
[7] Gheorghe Paun,et al. Membrane Computing , 2002, Natural Computing Series.
[8] Bruce Alberts,et al. Essential Cell Biology , 1983 .
[9] Andrei Paun,et al. ReMembrane Systems with Coupled Transport: Universality and Normal Forms , 2002, Fundam. Informaticae.
[10] Andrei Paun,et al. Further Remarks on P Systems with Symport Rules , 2001, Sci. Ann. Cuza Univ..
[11] Rudolf Freund,et al. On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars , 2001, MCU.
[12] Petr Sosík,et al. Membrane Computing: When Communication Is Enough , 2002, UMC.
[13] Grzegorz Rozenberg,et al. Membrane Computing , 2003, Lecture Notes in Computer Science.
[14] Cristian S. Calude,et al. Computing with Cells and Atoms: An Introduction to Quantum, DNA and Membrane Computing , 2000 .
[15] Gheorghe Paun,et al. Computing with Membranes , 2000, J. Comput. Syst. Sci..
[16] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.
[17] Rudolf Freund,et al. GP Systems with Forbidding Context , 2002, Fundam. Informaticae.