Pages that link to "Item:Q3298123"
From MaRDI portal
The following pages link to Linear automata with translucent letters and linear context-free trace languages (Q3298123):
Displaying 6 items.
- On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN (Q2035005) (← links)
- A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model (Q2675809) (← links)
- On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers (Q5021109) (← links)
- State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata (Q6095517) (← links)
- \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter (Q6177182) (← links)
- State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters (Q6204134) (← links)
