Pages that link to "Item:Q1109707"
From MaRDI portal
The following pages link to Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors (Q1109707):
Displaying 50 items.
- Modelling DNA and RNA secondary structures using matrix insertion-deletion systems (Q285429) (← links)
- Deciding whether a regular language is generated by a splicing system (Q340586) (← links)
- Commutator algebras arising from splicing operations (Q403191) (← links)
- Splicing systems and the Chomsky hierarchy (Q428896) (← links)
- Spatial cluster analysis by the Adleman-Lipton DNA computing model and flexible grids (Q444308) (← links)
- Finite-state automata in information technologies (Q464949) (← links)
- Computing with membranes and picture arrays (Q491611) (← links)
- Algorithmic applications of XPCR (Q553918) (← links)
- A characterization of (regular) circular languages generated by monotone complete splicing systems (Q606981) (← links)
- P systems and computational algebraic topology (Q630756) (← links)
- Splicing systems with targets are computationally universal (Q671404) (← links)
- The emerging discipline of biomolecular computation in the US (Q698876) (← links)
- Models of molecular computing based on molecular reactions (Q698877) (← links)
- Experimental efficiency of programmed mutagenesis (Q698889) (← links)
- Accepting networks of genetic processors are computationally complete (Q714860) (← links)
- DNA splicing: Computing by observing (Q835999) (← links)
- Constants and label-equivalence: a decision procedure for reflexive regular splicing languages (Q847663) (← links)
- Recognizing splicing languages: syntactic monoids and simultaneous pumping (Q881578) (← links)
- On length-separating test tube systems (Q934977) (← links)
- Accepting splicing systems (Q974105) (← links)
- A characterization of regular circular languages generated by marked splicing systems (Q1034615) (← links)
- Optical computing (Q1036535) (← links)
- A notion of information related to computation (Q1127395) (← links)
- Splicing semigroups of dominoes and DNA (Q1175793) (← links)
- Splicing representations of stricly locally testable languages (Q1270777) (← links)
- Splicing on tree-like structures (Q1274596) (← links)
- Computing by splicing (Q1349864) (← links)
- DNA computing: Arrival of biological mathematics (Q1361168) (← links)
- Simple splicing systems (Q1392573) (← links)
- Coding properties of DNA languages. (Q1401178) (← links)
- Direct constructions of universal extended H systems. (Q1401272) (← links)
- Living systems are dynamically stable by computing themselves at the quantum level (Q1407262) (← links)
- Aqueous computing: A survey with an invitation to participate. (Q1433943) (← links)
- Splicing in abstract families of languages (Q1575672) (← links)
- DNA computing based on splicing: Universality results (Q1575909) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- On the universality of Post and splicing systems (Q1575914) (← links)
- Using DNA to solve the bounded Post correspondence problem (Q1575917) (← links)
- Computing with membranes (Q1582013) (← links)
- Separating some splicing models. (Q1603389) (← links)
- Efficient DNA sticker algorithms for NP-complete graph problems (Q1605127) (← links)
- Aparallel digraphs and splicing machines (Q1660276) (← links)
- The structure of reflexive regular splicing languages via Schützenberger constants (Q1779297) (← links)
- Cut, paste and filter. (Q1811127) (← links)
- Topics in the theory of DNA computing. (Q1853473) (← links)
- A guide to membrane computing. (Q1853480) (← links)
- Conjugacy on partial words. (Q1853530) (← links)
- Forbidding--enforcing systems (Q1870557) (← links)
- The conformon-P system: a molecular and cell biology-inspired computability model (Q1884951) (← links)
- On the splicing operation (Q1923595) (← links)