The following pages link to (Q3396577):
Displaying 11 items.
- State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata (Q2003500) (← links)
- On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN (Q2035005) (← links)
- On the descriptional complexity of Watson-Crick automata (Q2271460) (← links)
- Reversible Watson-Crick automata (Q2406432) (← links)
- Unary Watson-Crick automata (Q2420646) (← links)
- \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata (Q2666842) (← links)
- Peptide Computers (Q3166940) (← links)
- Linear automata with translucent letters and linear context-free trace languages (Q3298123) (← links)
- (Q5016370) (← links)
- State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata (Q6095517) (← links)
- \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter (Q6177182) (← links)