scientific article; zbMATH DE number 1236223

zbMath0940.68053MaRDI QIDQ4223673

Gheorghe Păun, Grzegorz Rozenberg, Arto Salomaa

Publication date: 6 January 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

DNA computing

Mathematics Subject Classification ID

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

Capturing Membrane Computing by ASMs ⋮ Circular Post Machines and P Systems with Exo-insertion and Deletion ⋮ Peptide Computers ⋮ Equations in the Partial Semigroup of Words with Overlapping Products ⋮ Accepting splicing systems with permitting and forbidding words ⋮ A DNA-based graph encoding scheme with its applications to graph isomorphism problems ⋮ On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems ⋮ Universality in Molecular and Cellular Computing ⋮ Circular splicing and regularity ⋮ Computational completeness of path-structured graph-controlled insertion-deletion systems ⋮ Reversible Watson-Crick automata ⋮ \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata ⋮ Small Universal Devices ⋮ Language generating alphabetic flat splicing P systems ⋮ Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States ⋮ A Characterization of NP Within Interval-Valued Computing ⋮ Transformation of variants of Petri nets into context-dependent fusion grammars ⋮ A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model ⋮ Networks of splicing processors: simulations between topologies ⋮ Investigations on the power of matrix insertion-deletion systems with small sizes ⋮ Some wonders of a bio-computer-scientist ⋮ Unary Watson-Crick automata ⋮ DNAQL: a query language for DNA sticker complexes ⋮ Conjugate word blending: formal model and experimental implementation by XPCR ⋮ On the generative capacity of matrix insertion-deletion systems of small sum-norm ⋮ Single semi-contextual insertion-deletion systems ⋮ State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two-dimensional Fibonacci words: tandem repeats and factor complexity ⋮ Watson-Crick powers of a word ⋮ On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2 ⋮ Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1) ⋮ Unnamed Item ⋮ When Stars Control a Grammar's Work ⋮ State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters ⋮ Networks of Watson-Crick D0L systems with communication by substrings ⋮ Unnamed Item ⋮ Parikh Images of Matrix Ins-Del Systems ⋮ Further Results on Insertion-Deletion Systems with One-Sided Contexts ⋮ Graph Multiset Transformation as a Framework for Massively Parallel Computation ⋮ GENE ASSEMBLY MODELS AND BOOLEAN CIRCUITS ⋮ Complexity theory for splicing systems ⋮ Linear automata with translucent letters and linear context-free trace languages ⋮ Localization of electronic states in chain models based on real DNA sequence ⋮ On Basic Properties of Jumping Finite Automata ⋮ Regulated RNA rewriting: Modelling RNA editing with guided insertion ⋮ On Some Biologically Motivated Control Devices for Parallel Rewriting ⋮ Computing by polymerase chain reaction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decidability Questions for Insertion Systems and Related Models ⋮ A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers ⋮ Memetic algorithms: The polynomial local search complexity theory perspective ⋮ Interval-valued computations and their connection with PSPACE ⋮ Regular splicing languages and subclasses ⋮ Linear splicing and syntactic monoid ⋮ Watson-Crick D0L systems with regular triggers ⋮ Logical string rewriting ⋮ Graph splicing systems ⋮ An alternative definition of splicing ⋮ Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems ⋮ On the power of parallel communicating Watson-Crick automata systems ⋮ Formal properties of PA-matching ⋮ Operations and language generating devices suggested by the genome evolution ⋮ COMPUTATIONAL POWER OF INTRAMOLECULAR GENE ASSEMBLY ⋮ On the regularity of circular splicing languages: a survey and new developments ⋮ On 5′→3′ Sensing Watson-Crick Finite Automata ⋮ New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality ⋮ Recognizing DNA Splicing ⋮ On Computational Properties of Template-Guided DNA Recombination ⋮ Hairpin Structures in DNA Words ⋮ Communicating Distributed H Systems: Optimal Results with Efficient Ways of Communication ⋮ Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity ⋮ Two-Party Watson-Crick Computations ⋮ On Compensation Loops in Genomic Duplications ⋮ ENCODINGS OF MULTISETS ⋮ On bonded sequential and parallel insertion systems ⋮ Some Remarks on Superposition Based on Watson-Crick-Like Complementarity ⋮ Splicing Systems: Accepting Versus Generating ⋮ Defining Languages by Forbidding-Enforcing Systems ⋮ Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems ⋮ On the power of circular splicing ⋮ A boundary result on enhanced time-varying distributed H systems with parallel computations ⋮ Watson–Crick Jumping Finite Automata ⋮ On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers ⋮ On the computational completeness of graph-controlled insertion-deletion systems with binary sizes ⋮ A DNA algorithm for the maximal matching problem ⋮ Modelling DNA and RNA secondary structures using matrix insertion-deletion systems ⋮ Parsimonious computational completeness ⋮ From regulated rewriting to computing with membranes: collapsing hierarchies ⋮ Peg-solitaire, string rewriting systems and finite automata ⋮ DNA splicing: Computing by observing ⋮ Constants and label-equivalence: a decision procedure for reflexive regular splicing languages ⋮ String assembling systems: comparison to sticker systems and decidability ⋮ DNA ternary addition ⋮ A DNA procedure for solving the shortest path problem ⋮ Languages generated by iterated idempotency ⋮ Quorum sensing P systems ⋮ Solving the maximum weighted clique problem based on parallel biological computing model

This page was built for publication: