scientific article; zbMATH DE number 1236223
From MaRDI portal
Publication:4223673
Recommendations
Cited in
(only showing first 100 items - show all)- Computational expressiveness of genetic systems
- Pictures worth a thousand tiles, a geometrical programming language for self-assembly
- Parallel DNA arithmetic operation based on \(n\)-moduli set
- A characterization of regular circular languages generated by marked splicing systems
- Sticker systems
- Watson-Crick D0L systems: The power of one transition
- Coding properties of DNA languages.
- Gemmating P systems: Collapsing hierarchies.
- Direct constructions of universal extended H systems.
- Decidability results for Watson-Crick D0L systems with nonregular triggers.
- Watson-Crick D0L systems: Generative power and undecidable problems.
- A metric space to study differences between polynucleotides
- Aqueous computing: A survey with an invitation to participate.
- On strongly context-free languages
- DNA computing based on splicing: Universality results
- Computing with membranes
- Language-theoretic aspects of DNA complementarity
- Separating some splicing models.
- Uni-transitional Watson-Crick D0L systems
- Efficient DNA sticker algorithms for NP-complete graph problems
- Solving the maximum weighted clique problem based on parallel biological computing model
- An adaptive and robust biological network based on the vacant-particle transportation model
- Non-regular unary language and parallel communicating Watson-Crick automata systems
- Discrete Watson-Crick dynamical systems
- On path-controlled insertion-deletion systems
- A study of entropy/clarity of genetic sequences using metric spaces and fuzzy sets
- Biocomputing: an insight from linguistics
- Stateless multicounter 5' 3' Watson-Crick automata: the deterministic case
- Template-guided DNA recombination
- Context-free insertion-deletion systems
- Theoretical and experimental DNA computation.
- The structure of reflexive regular splicing languages via Schützenberger constants
- On properties of bond-free DNA languages
- Why has nature invented three stop codons of DNA and only one start codon?
- Minimal model of a cell connecting amoebic motion and adaptive transport networks
- Topics in the theory of DNA computing.
- A guide to membrane computing.
- Solution of a problem in DNA computing.
- Universal computation with Watson-Crick D0L systems.
- Molecular interaction.
- Formal systems for gene assembly in ciliates.
- Forbidding--enforcing systems
- DNA computing by blocking
- From regulated rewriting to computing with membranes: collapsing hierarchies
- Peg-solitaire, string rewriting systems and finite automata
- Fuzzy multiset finite automata and their languages
- Spatial cluster analysis by the bin-packing problem and DNA computing technique
- Time and space complexity for splicing systems
- On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
- State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata
- Universal insertion grammars of size two
- Watson-Crick quantum finite automata
- Context-sensitive fusion grammars and fusion grammars with forbidden context are universal
- Processing natural language with biomolecules: where linguistics, biology and computation meet
- Insertion-deletion systems with substitutions. I
- String assembling systems: comparison to sticker systems and decidability
- \(\mathcal{L}\)-reduction computation revisited
- Hybrid and generalized marked systems
- On the descriptional complexity of Watson-Crick automata
- Hairpin structures defined by DNA trajectories
- Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
- Derivation languages and descriptional complexity measures of restricted flat splicing systems
- On the overlap assembly of strings and languages
- Theory of tailor automata
- Existence of constants in regular splicing languages
- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
- Accepting splicing systems with permitting and forbidding words
- A DNA-based graph encoding scheme with its applications to graph isomorphism problems
- Computational completeness of path-structured graph-controlled insertion-deletion systems
- Reversible Watson-Crick automata
- Language generating alphabetic flat splicing P systems
- Unary Watson-Crick automata
- Complexity theory for splicing systems
- Localization of electronic states in chain models based on real DNA sequence
- Regulated RNA rewriting: Modelling RNA editing with guided insertion
- Computing by polymerase chain reaction
- 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
- 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
- On the power of circular splicing
- Graph-theoretic formalization of hybridization in DNA sticker complexes
- Generating and accepting P systems with minimal left and right insertion and deletion
- A boundary result on enhanced time-varying distributed H systems with parallel computations
- \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata
- Transformation of variants of Petri nets into context-dependent fusion grammars
- A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
- Some wonders of a bio-computer-scientist
- A DNA algorithm for the maximal matching problem
- Descriptional complexity of graph-controlled insertion-deletion systems
- Modelling DNA and RNA secondary structures using matrix insertion-deletion systems
- Circular Post machines and P systems with exo-insertion and deletion
- Small universal devices
- Universality of graph-controlled leftist insertion-deletion systems with two states
- A characterization of NP within interval-valued computing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223673)
