About Time-Varying Distributed H Systems
暂无分享,去创建一个
[1] Erzsébet Csuhaj-Varjú,et al. Test Tube Distributed Systems Based on Splicing , 1996, Comput. Artif. Intell..
[2] Gheorghe Paun,et al. Language Theory and Molecular Genetics: Generative Mechanisms Suggested by DNA Recombination , 1997, Handbook of Formal Languages.
[3] Gheorghe Paun,et al. Regular Extended H Systems are Computationally Universal , 1996, J. Autom. Lang. Comb..
[4] Gheorghe Paun,et al. DNA Computing: New Computing Paradigms , 1998 .
[5] Gheorghe Paun,et al. DNA computing based on splicing: universality results. , 1996, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.
[6] Gheorghe Paun,et al. DNA Computing: Distributed Splicing Systems , 1997, Structures in Logic and Computer Science.
[7] Grzegorz Rozenberg,et al. Introduction: DNA Computing in a Nutshell , 1998 .
[8] Gheorghe Paun,et al. Computing by Splicing , 1996, Theor. Comput. Sci..
[9] T. Head. Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. , 1987, Bulletin of mathematical biology.
[10] Maurice Margenstern,et al. A universal time-varying distributed H-system of degree 2 , 1999 .
[11] Andrei Paun. On Time-Varying H Systems , 1999, Bull. EATCS.
[12] Dennis Pixton,et al. Regularity of Splicing Languages , 1996, Discret. Appl. Math..
[13] Giancarlo Mauri,et al. Nine Test Tubes Generate any RE Language , 1998, MCU.
[14] 榊原 康文,et al. G. Paun, G. Rozenberg and A. Salomaa : "DNA Computing-New Computing Paradigms", Springer-Verlag (1998) , 2000 .
[15] Yurii Rogozhin,et al. Small Universal Turing Machines , 1996, Theor. Comput. Sci..
[16] L Priese,et al. Finite H-systems with 3 test tubes are not predictable. , 1998, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.
[17] Maurice Margenstern,et al. Frontier between decidability and undecidability: a survey , 2000, Theor. Comput. Sci..