The following pages link to (Q4263693):
Displaying 18 items.
- Doubler and linearizer: An approach toward a unified theory for molecular computing based on DNA complementarity (Q926525) (← links)
- Non-regular unary language and parallel communicating Watson-Crick automata systems (Q1680552) (← links)
- Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case (Q1761728) (← links)
- State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata (Q2003500) (← links)
- Watson-Crick quantum finite automata (Q2035008) (← links)
- Theory of tailor automata (Q2315015) (← links)
- Reversible Watson-Crick automata (Q2406432) (← links)
- Unary Watson-Crick automata (Q2420646) (← links)
- \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata (Q2666842) (← links)
- 5′ → 3′ Watson-Crick AutomataWith Several Runs (Q3000291) (← links)
- Two-Party Watson-Crick Computations (Q3073638) (← links)
- Linear automata with translucent letters and linear context-free trace languages (Q3298123) (← links)
- Watson-Crick T0L Systems and Red-Green Register Machines (Q4601150) (← links)
- On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers (Q5021109) (← links)
- Binding-blocking automata (Q5416433) (← links)
- On 5′→3′ Sensing Watson-Crick Finite Automata (Q5452699) (← links)
- Watson–Crick Jumping Finite Automata (Q5859652) (← links)
- State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters (Q6204134) (← links)
