The following pages link to (Q4223673):
Displaying 50 items.
- Computing with membranes (Q1582013) (← links)
- Language-theoretic aspects of DNA complementarity (Q1589432) (← links)
- Separating some splicing models. (Q1603389) (← links)
- Uni-transitional Watson-Crick D0L systems (Q1603703) (← links)
- Efficient DNA sticker algorithms for NP-complete graph problems (Q1605127) (← links)
- Solving the maximum weighted clique problem based on parallel biological computing model (Q1665198) (← links)
- An adaptive and robust biological network based on the vacant-particle transportation model (Q1670644) (← links)
- Non-regular unary language and parallel communicating Watson-Crick automata systems (Q1680552) (← links)
- Discrete Watson-Crick dynamical systems (Q1682862) (← links)
- On path-controlled insertion-deletion systems (Q1713412) (← links)
- A study of entropy/clarity of genetic sequences using metric spaces and fuzzy sets (Q1732933) (← links)
- Biocomputing: an insight from linguistics (Q1761720) (← links)
- Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case (Q1761728) (← links)
- Template-guided DNA recombination (Q1763713) (← links)
- Context-free insertion-deletion systems (Q1763721) (← links)
- The structure of reflexive regular splicing languages via Schützenberger constants (Q1779297) (← links)
- On properties of bond-free DNA languages (Q1779300) (← links)
- Why has nature invented three stop codons of DNA and only one start codon? (Q1784389) (← links)
- Minimal model of a cell connecting amoebic motion and adaptive transport networks (Q1796334) (← links)
- Topics in the theory of DNA computing. (Q1853473) (← links)
- A guide to membrane computing. (Q1853480) (← links)
- Solution of a problem in DNA computing. (Q1853482) (← links)
- Universal computation with Watson-Crick D0L systems. (Q1853540) (← links)
- Molecular interaction. (Q1853559) (← links)
- Formal systems for gene assembly in ciliates. (Q1853740) (← links)
- Forbidding--enforcing systems (Q1870557) (← links)
- DNA computing by blocking (Q1870560) (← links)
- From regulated rewriting to computing with membranes: collapsing hierarchies (Q1884943) (← links)
- Peg-solitaire, string rewriting systems and finite automata (Q1885909) (← links)
- Fuzzy multiset finite automata and their languages (Q1955451) (← links)
- Spatial cluster analysis by the bin-packing problem and DNA computing technique (Q1956125) (← links)
- Time and space complexity for splicing systems (Q1959375) (← links)
- On the computing powers of \(\mathcal{L}\)-reductions of insertion languages (Q1998879) (← links)
- State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata (Q2003500) (← links)
- Universal insertion grammars of size two (Q2004002) (← links)
- Watson-Crick quantum finite automata (Q2035008) (← links)
- Context-sensitive fusion grammars and fusion grammars with forbidden context are universal (Q2084774) (← links)
- Processing natural language with biomolecules: where linguistics, biology and computation meet (Q2104262) (← links)
- Insertion-deletion systems with substitutions. I (Q2106623) (← links)
- String assembling systems: comparison to sticker systems and decidability (Q2152089) (← links)
- \(\mathcal{L}\)-reduction computation revisited (Q2170281) (← links)
- Hybrid and generalized marked systems (Q2243582) (← links)
- On the descriptional complexity of Watson-Crick automata (Q2271460) (← links)
- Hairpin structures defined by DNA trajectories (Q2272214) (← links)
- Solution to PSPACE-complete problem using P systems with active membranes with time-freeness (Q2298575) (← links)
- Derivation languages and descriptional complexity measures of restricted flat splicing systems (Q2306014) (← links)
- On the overlap assembly of strings and languages (Q2311303) (← links)
- Theory of tailor automata (Q2315015) (← links)
- Existence of constants in regular splicing languages (Q2346417) (← links)
- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes (Q2358685) (← links)