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

DOI10.1007/BF02481771zbMath0655.92008OpenAlexW2058302256WikidataQ52616830 ScholiaQ52616830MaRDI QIDQ1109707

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1007/bf02481771

zbMATH Keywords

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

Formal languages and automata (68Q45) Artificial intelligence (68T99) Genetics and epigenetics (92D10) Physiological, cellular and medical topics (92Cxx)

Related Items (only showing first 100 items - show all)

Networks of splicing processors: simulations between topologies ⋮ Small networks of polarized splicing processors are universal ⋮ Conjugate word blending: formal model and experimental implementation by XPCR ⋮ Array P systems and pure 2D context-free grammars with independent mode of rewriting ⋮ Descriptional Complexity of Semi-Simple Splicing Systems ⋮ Evaluating space measures in P systems ⋮ STRICT LOCAL TESTABILITY WITH CONSENSUS EQUALS REGULARITY, AND OTHER PROPERTIES ⋮ 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 ⋮ DNA Splicing Systems ⋮ LANGUAGE FAMILIES DEFINED BY A CILIATE BIO-OPERATION: HIERARCHIES AND DECISION PROBLEMS ⋮ Insertion-deletion systems with substitutions I ⋮ Descriptional Complexity of Semi-simple Splicing Systems ⋮ Modelling DNA and RNA secondary structures using matrix insertion-deletion systems ⋮ The conformon-P system: a molecular and cell biology-inspired computability model ⋮ DNA splicing: Computing by observing ⋮ Accepting splicing systems with permitting and forbidding words ⋮ Non-preserving splicing with delay ⋮ Networks of Polarized Splicing Processors ⋮ Computing by splicing ⋮ Constants and label-equivalence: a decision procedure for reflexive regular splicing languages ⋮ DNA computing: Arrival of biological mathematics ⋮ Deciding whether a regular language is generated by a splicing system ⋮ Universality in Molecular and Cellular Computing ⋮ Circular splicing and regularity ⋮ Aparallel digraphs and splicing machines ⋮ Splicing systems and regularity ⋮ On the splicing operation ⋮ Regularity of splicing languages ⋮ A characterization of (regular) circular languages generated by monotone complete splicing systems ⋮ A notion of information related to computation ⋮ Recognizing splicing languages: syntactic monoids and simultaneous pumping ⋮ Small Universal Devices ⋮ Language generating alphabetic flat splicing P systems ⋮ Simple splicing systems ⋮ Commutator algebras arising from splicing operations ⋮ Some wonders of a bio-computer-scientist ⋮ Monotonically controlling right linear grammars with unknown behaviors to output a target string ⋮ Coding properties of DNA languages. ⋮ Direct constructions of universal extended H systems. ⋮ P systems and computational algebraic topology ⋮ Living systems are dynamically stable by computing themselves at the quantum level ⋮ Splicing systems and the Chomsky hierarchy ⋮ Spatial cluster analysis by the Adleman-Lipton DNA computing model and flexible grids ⋮ Rewriting P Systems with Flat-Splicing Rules ⋮ DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS ⋮ RNA-guided DNA assembly ⋮ Time and space complexity for splicing systems ⋮ Finite-state automata in information technologies ⋮ GENE ASSEMBLY MODELS AND BOOLEAN CIRCUITS ⋮ Splicing semigroups of dominoes and DNA ⋮ Aqueous computing: A survey with an invitation to participate. ⋮ Complexity theory for splicing systems ⋮ On length-separating test tube systems ⋮ DNA cyclic codes over the ring 𝔽2[u,v/〈u2 − 1,v3 − v,uv − vu〉] ⋮ Computing with membranes and picture arrays ⋮ Splicing systems with targets are computationally universal ⋮ Hybrid and generalized marked systems ⋮ Language-theoretic aspects of string replication^∗ ⋮ Computing by polymerase chain reaction ⋮ Unnamed Item ⋮ Reducing control alphabet size for the control of right linear grammars with unknown behaviors ⋮ A Note on Parallel Splicing on Images ⋮ ON SMALL UNIVERSAL SPLICING SYSTEMS ⋮ Regular splicing languages and subclasses ⋮ The emerging discipline of biomolecular computation in the US ⋮ Models of molecular computing based on molecular reactions ⋮ Experimental efficiency of programmed mutagenesis ⋮ Finite language forbidding-enforcing systems ⋮ Linear splicing and syntactic monoid ⋮ Accepting splicing systems ⋮ Algorithmic applications of XPCR ⋮ Graph splicing systems ⋮ Accepting networks of genetic processors are computationally complete ⋮ The structure of reflexive regular splicing languages via Schützenberger constants ⋮ An alternative definition of splicing ⋮ Approximate reasoning on a DNA‐chip ⋮ Networks of splicing processors with evaluation sets as optimization problems solvers ⋮ COMPUTATIONAL POWER OF INTRAMOLECULAR GENE ASSEMBLY ⋮ Recognizing DNA Splicing ⋮ On Computational Properties of Template-Guided DNA Recombination ⋮ DNA Recombination by XPCR ⋮ SMALL UNIVERSAL TVDH AND TEST TUBE SYSTEMS ⋮ Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application ⋮ Cut, paste and filter. ⋮ Splicing Systems: Accepting Versus Generating ⋮ Defining Languages by Forbidding-Enforcing Systems ⋮ Splicing representations of stricly locally testable languages ⋮ Splicing on tree-like structures ⋮ Theory of tailor automata ⋮ A characterization of regular circular languages generated by marked splicing systems ⋮ Optical computing ⋮ FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES ⋮ Splicing in abstract families of languages ⋮ DNA computing based on splicing: Universality results ⋮ Frontier between decidability and undecidability: A survey

Cites Work

This page was built for publication: Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors