Pages that link to "Item:Q5452699"
From MaRDI portal
The following pages link to On 5′→3′ Sensing Watson-Crick Finite Automata (Q5452699):
Displaying 18 items.
- The Viterbi algorithm for subsets of stochastic context-free languages (Q1708272) (← links)
- Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case (Q1761728) (← links)
- On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN (Q2035005) (← links)
- \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata (Q2666842) (← links)
- A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model (Q2675809) (← 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)
- (Q4988164) (← links)
- (Q5016370) (← links)
- On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers (Q5021109) (← links)
- On double-jumping finite automata and their closure properties (Q5223615) (← links)
- Binding-blocking automata (Q5416433) (← links)
- State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata (Q6095517) (← links)
- \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter (Q6177182) (← links)
- Non-returning deterministic and nondeterministic finite automata with translucent letters (Q6186539) (← links)
- Reversible Two-Party Computations (Q6204131) (← links)
- State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters (Q6204134) (← links)
