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):
Displayed 50 items.
- Reducing control alphabet size for the control of right linear grammars with unknown behaviors (Q1998876) (← links)
- Finite language forbidding-enforcing systems (Q2011661) (← links)
- Processing natural language with biomolecules: where linguistics, biology and computation meet (Q2104262) (← links)
- RNA-guided DNA assembly (Q2211655) (← links)
- Hybrid and generalized marked systems (Q2243582) (← links)
- Networks of splicing processors with evaluation sets as optimization problems solvers (Q2282068) (← links)
- Theory of tailor automata (Q2315015) (← links)
- Existence of constants in regular splicing languages (Q2346417) (← links)
- Accepting splicing systems with permitting and forbidding words (Q2376984) (← links)
- Language generating alphabetic flat splicing P systems (Q2413312) (← links)
- Monotonically controlling right linear grammars with unknown behaviors to output a target string (Q2422039) (← links)
- Complexity theory for splicing systems (Q2455600) (← links)
- Computing by polymerase chain reaction (Q2476101) (← links)
- Regular splicing languages and subclasses (Q2484444) (← links)
- Linear splicing and syntactic monoid (Q2489941) (← links)
- Graph splicing systems (Q2495908) (← links)
- An alternative definition of splicing (Q2503274) (← links)
- On the power of circular splicing (Q2565850) (← links)
- A boundary result on enhanced time-varying distributed H systems with parallel computations (Q2575080) (← links)
- Some wonders of a bio-computer-scientist (Q2678667) (← links)
- FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES (Q2841978) (← links)
- Small Universal Devices (Q2944894) (← links)
- Rewriting P Systems with Flat-Splicing Rules (Q2975923) (← links)
- Approximate reasoning on a DNA‐chip (Q3059787) (← links)
- COMPUTATIONAL POWER OF INTRAMOLECULAR GENE ASSEMBLY (Q3065620) (← links)
- SMALL UNIVERSAL TVDH AND TEST TUBE SYSTEMS (Q3076606) (← links)
- Splicing Systems: Accepting Versus Generating (Q3091439) (← links)
- Defining Languages by Forbidding-Enforcing Systems (Q3091444) (← links)
- Universality in Molecular and Cellular Computing (Q3195684) (← links)
- DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS (Q3526537) (← links)
- GENE ASSEMBLY MODELS AND BOOLEAN CIRCUITS (Q3542874) (← links)
- Recognizing DNA Splicing (Q3618677) (← links)
- On Computational Properties of Template-Guided DNA Recombination (Q3618678) (← links)
- DNA Recombination by XPCR (Q3618680) (← links)
- Splicing systems and regularity (Q4009701) (← links)
- Language-theoretic aspects of string replication<sup>∗</sup> (Q4380273) (← links)
- DNA cyclic codes over the ring 𝔽2[u,v]/〈u2 − 1,v3 − v,uv − vu〉 (Q4636794) (← links)
- Circular splicing and regularity (Q4825394) (← links)
- A Note on Parallel Splicing on Images (Q4917105) (← links)
- ON SMALL UNIVERSAL SPLICING SYSTEMS (Q4923288) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- Insertion-deletion systems with substitutions I (Q5037217) (← links)
- Descriptional Complexity of Semi-simple Splicing Systems (Q5041256) (← links)
- Networks of Polarized Splicing Processors (Q5055983) (← links)
- (Q5061519) (← links)
- Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application (Q5217119) (← links)
- Professor Zdzisław Pawlak (1926-2006): Founder of the Polish School of Artificial Intelligence (Q5245174) (← links)
- Non-preserving splicing with delay (Q5297935) (← links)
- STRICT LOCAL TESTABILITY WITH CONSENSUS EQUALS REGULARITY, AND OTHER PROPERTIES (Q5401553) (← links)
- DNA Splicing Systems (Q5452697) (← links)