Pages that link to "Item:Q2271460"
From MaRDI portal
The following pages link to On the descriptional complexity of Watson-Crick automata (Q2271460):
Displaying 11 items.
- Non-regular unary language and parallel communicating Watson-Crick automata systems (Q1680552) (← links)
- State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata (Q2003500) (← links)
- Watson-Crick quantum finite automata (Q2035008) (← links)
- Reversible Watson-Crick automata (Q2406432) (← links)
- Unary Watson-Crick automata (Q2420646) (← links)
- Nonterminal complexity of one-sided random context grammars (Q2428495) (← links)
- Two-Party Watson-Crick Computations (Q3073638) (← links)
- On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers (Q5021109) (← links)
- Operational Accepting State Complexity: The Unary and Finite Case (Q5205038) (← links)
- State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata (Q6095517) (← links)
- Reversible Two-Party Computations (Q6204131) (← links)
