Generalized P-Systems with Splicing and Cutting/Recombination
暂无分享,去创建一个
[1] Rudolf Freund,et al. Test tube systems: when two tubes are enough , 1999, Developments in Language Theory.
[2] Ion Petre,et al. A Normal form for P-Systems , 1999, Bull. EATCS.
[3] Gheorghe Paun,et al. Membrane Computing with External Output , 2000, Fundam. Informaticae.
[4] Gheorghe Paun,et al. On the Power of Membrane Computing , 1999, J. Univers. Comput. Sci..
[5] Erzsébet Csuhaj-Varjú,et al. Test Tube Distributed Systems Based on Splicing , 1996, Comput. Artif. Intell..
[6] Rudolf Freund,et al. Universal Systems with Operations Related to Splicing , 1996, Comput. Artif. Intell..
[7] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .
[8] Rudolf Freund,et al. DNA Computing Based on Splicing: The Existence of Universal Computers , 1999, Theory of Computing Systems.
[9] Rudolf Freund,et al. Test Tube Systems or How to Bake a DNA Cake , 1996, Acta Cybern..
[10] Gheorghe Paun,et al. Computing with Membranes: An Introduction , 1999, Bull. EATCS.
[11] Gheorghe Paun,et al. Regular Extended H Systems are Computationally Universal , 1996, J. Autom. Lang. Comb..
[12] E. Csuhaj-Varjú,et al. Test tube systems with cutting/recombination operations. , 1997, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.
[13] Rudolf Freund. Generalized P-Systems , 1999, FCT.
[14] Gérard Berry,et al. The chemical abstract machine , 1989, POPL '90.
[15] Gheorghe Paun,et al. DNA computing based on splicing: universality results. , 1996, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.
[16] Gheorghe Paun,et al. Computing with Membranes , 2000, J. Comput. Syst. Sci..
[17] L M Adleman,et al. Molecular computation of solutions to combinatorial problems. , 1994, Science.
[18] Gheorghe Paun,et al. DNA Computing: New Computing Paradigms , 1998 .