Language Theory and Molecular Genetics: Generative Mechanisms Suggested by DNA Recombination
暂无分享,去创建一个
Gheorghe Paun | Dennis Pixton | Thomas Head | G. Paun | T. Head | D. Pixton | T. Head
[1] David B. Searls,et al. The Linguistics of DNA , 1992 .
[2] Rani Siromoney,et al. Circular DNA and Splicing Systems , 1992, ICPIA.
[3] Samuel Eilenberg,et al. Review of "Algebraic and automata-theoretic properties of formal languages" by Seymour Ginsburg. North Holland, 1975. , 1976, SIGA.
[4] Tero Harju,et al. Splicing semigroups of dominoes and DNA , 1991, Discret. Appl. Math..
[5] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.
[6] Victor Mitrana,et al. Splicing Grammar Systems , 1996, Comput. Artif. Intell..
[7] D. Pixton. Linear and circular splicing systems , 1995, Proceedings First International Symposium on Intelligence in Neural and Biological Systems. INBS'95.
[8] Tom Head,et al. Splicing Schemes and DNA , 1992 .
[9] Erzsébet Csuhaj-Varjú,et al. Test Tube Distributed Systems Based on Splicing , 1996, Comput. Artif. Intell..
[10] Antonio Restivo,et al. A Characterization of Strictly Locally Testable Languages and Its Applications to Subsemigroups of a Free Semigroup , 1980, Inf. Control..
[11] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[12] Satoshi Kobayashi,et al. On the power of circular splicing systems and DNA computability , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).
[13] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .
[14] Marcel Paul Schützenberger,et al. On Finite Monoids Having Only Trivial Subgroups , 1965, Inf. Control..
[15] R. W. Gatterdam. Splicing systems and regularity , 1989 .
[16] Julio Collado-Vides,et al. The search for a grammatical theory of gene regulation is formally justified by showing the inadequacy of context-free grammars , 1991, Comput. Appl. Biosci..
[17] Cristian S. Calude,et al. Global syntax and semantics for recursively enumerable languages , 1981, Fundam. Informaticae.
[18] Gheorghe Paun,et al. On the Splicing Operation , 1996, Discret. Appl. Math..
[19] Rudolf Freund,et al. DNA Computing Based on Splicing: The Existence of Universal Computers , 1999, Theory of Computing Systems.
[20] Gheorghe Paun,et al. Simple Splicing Systems , 1998, Discret. Appl. Math..
[21] Jozef Gruska. Descriptional Complexity of Context-Free Languages , 1973, MFCS.
[22] Barron Brainerd. An Analog of a Theorem about Contex-Free Languages , 1967, Inf. Control..
[23] Gheorghe Paun,et al. Restricted use of the splicing operation , 1996, Int. J. Comput. Math..
[24] Gheorghe Paun,et al. Computing by Splicing , 1996, Theor. Comput. Sci..
[25] Arto Salomaa,et al. On the Index of a Context-Free Grammar and Language , 1969, Inf. Control..
[26] Solomon Marcus,et al. Contextual Grammars , 1969, COLING.
[27] Takashi Yokomori,et al. DNA evolutionary linguistics and RNA structure modeling: a computational approach , 1995, Proceedings First International Symposium on Intelligence in Neural and Biological Systems. INBS'95.
[28] Gheorghe Paun,et al. The Power of Restricted Splicing with Rules from a Regular Language , 1996, J. Univers. Comput. Sci..
[29] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .
[30] C Ferretti,et al. DNA splicing systems and post systems. , 1996, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.
[31] Grzegorz Rozenberg,et al. Developmental systems and languages , 1972, STOC.
[32] Gheorghe Paun,et al. Regular Extended H Systems are Computationally Universal , 1996, J. Autom. Lang. Comb..
[33] Dennis Pixton,et al. Regularity of Splicing Languages , 1996, Discret. Appl. Math..
[34] R. McNaughton,et al. Counter-Free Automata , 1971 .
[35] Gheorghe Paun,et al. Generating Strings by Replication: A Simple Case , 1996 .
[36] Yuji Takada,et al. On Identifying DNA Splicing Systems from Examples , 1992, AII.
[37] T. Head. Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. , 1987, Bulletin of mathematical biology.
[38] Jozef Gruska. A Few Remarks on the Index of Context-Free Grammars and Languages , 1971, Inf. Control..
[39] Lucian Ilie,et al. Crossing-over on Languages. A Formal Representation of the Chromosome Recombination , 1996, German Conference on Bioinformatics.
[40] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .
[41] R. W. Gatterdam,et al. On the undecidability of splicing systems , 1989 .
[42] Gheorghe Paun,et al. DNA COMPUTING BASED ON THE SPLICING OPERATION , 1996 .
[43] Gheorghe Paun,et al. On the power of the splicing operation , 1995, Int. J. Comput. Math..