Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors

DOI10.1007/BF02481771zbMath0655.92008WikidataQ52616830 ScholiaQ52616830MaRDI QIDQ1109707

Publication date: 1987

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

regular languages; molecular biology; splicing systems; RNA; protein molecules; biochemistry; splicing languages; generative capacity; aminoacid; deoxyribonucleotide pairs; double-stranded DNA molecules; enzymatic activities; hydrogen-bounded deoxyribonucleotide pair; informational macromolecules; persistent splicing languages; recombination processes; ribonucleotide

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68T99: Artificial intelligence

92D10: Genetics and epigenetics

92Cxx: Physiological, cellular and medical topics

Related Items

Language-theoretic aspects of string replication^∗, Circular splicing and regularity, A Note on Parallel Splicing on Images, ON SMALL UNIVERSAL SPLICING SYSTEMS, Professor Zdzisław Pawlak (1926-2006): Founder of the Polish School of Artificial Intelligence, Non-preserving splicing with delay, STRICT LOCAL TESTABILITY WITH CONSENSUS EQUALS REGULARITY, AND OTHER PROPERTIES, DNA Splicing Systems, LANGUAGE FAMILIES DEFINED BY A CILIATE BIO-OPERATION: HIERARCHIES AND DECISION PROBLEMS, Multiple splicing systems and the universal computability, Logical string rewriting, Biomolecular realizations of a parallel architecture for solving combinatorial problems, Formal properties of PA-matching, Partial words and a theorem of Fine and Wilf revisited, On the regularity of circular splicing languages: a survey and new developments, Modelling DNA and RNA secondary structures using matrix insertion-deletion systems, Commutator algebras arising from splicing operations, Splicing systems and the Chomsky hierarchy, Spatial cluster analysis by the Adleman-Lipton DNA computing model and flexible grids, Finite-state automata in information technologies, Computing with membranes and picture arrays, Algorithmic applications of XPCR, A characterization of (regular) circular languages generated by monotone complete splicing systems, P systems and computational algebraic topology, Splicing systems with targets are computationally universal, The emerging discipline of biomolecular computation in the US, Models of molecular computing based on molecular reactions, Experimental efficiency of programmed mutagenesis, Accepting networks of genetic processors are computationally complete, DNA splicing: Computing by observing, Constants and label-equivalence: a decision procedure for reflexive regular splicing languages, Recognizing splicing languages: syntactic monoids and simultaneous pumping, On length-separating test tube systems, Accepting splicing systems, A characterization of regular circular languages generated by marked splicing systems, Optical computing, A notion of information related to computation, Splicing semigroups of dominoes and DNA, Splicing representations of stricly locally testable languages, Splicing on tree-like structures, Computing by splicing, DNA computing: Arrival of biological mathematics, Simple splicing systems, Coding properties of DNA languages., Direct constructions of universal extended H systems., Living systems are dynamically stable by computing themselves at the quantum level, Aqueous computing: A survey with an invitation to participate., Splicing in abstract families of languages, DNA computing based on splicing: Universality results, Frontier between decidability and undecidability: A survey, On the universality of Post and splicing systems, Using DNA to solve the bounded Post correspondence problem, Computing with membranes, Separating some splicing models., Efficient DNA sticker algorithms for NP-complete graph problems, The structure of reflexive regular splicing languages via Schützenberger constants, Cut, paste and filter., Topics in the theory of DNA computing., A guide to membrane computing., Conjugacy on partial words., Forbidding--enforcing systems, The conformon-P system: a molecular and cell biology-inspired computability model, On the splicing operation, Regularity of splicing languages, Time and space complexity for splicing systems, Existence of constants in regular splicing languages, Accepting splicing systems with permitting and forbidding words, Complexity theory for splicing systems, Computing by polymerase chain reaction, Regular splicing languages and subclasses, Linear splicing and syntactic monoid, Graph splicing systems, An alternative definition of splicing, On the power of circular splicing, A boundary result on enhanced time-varying distributed H systems with parallel computations, FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES, Small Universal Devices, Approximate reasoning on a DNA‐chip, COMPUTATIONAL POWER OF INTRAMOLECULAR GENE ASSEMBLY, SMALL UNIVERSAL TVDH AND TEST TUBE SYSTEMS, Splicing Systems: Accepting Versus Generating, Defining Languages by Forbidding-Enforcing Systems, Universality in Molecular and Cellular Computing, DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS, GENE ASSEMBLY MODELS AND BOOLEAN CIRCUITS, Recognizing DNA Splicing, On Computational Properties of Template-Guided DNA Recombination, DNA Recombination by XPCR, Splicing systems and regularity

Cites Work