Pages that link to "Item:Q2844002"

The following pages link to On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages (Q2844002):

Displaying 19 items.

• Simple picture processing based on finite automata and regular grammars (Q1747512) (← links)
• Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter (Q1799374) (← links)
• On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN (Q2035005) (← links)
• Contextual array grammars with matrix control, regular control languages, and tissue P systems control (Q2358676) (← links)
• \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata (Q2666842) (← links)
• A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model (Q2675809) (← links)
• Contextual Array Grammars with Matrix and Regular Control (Q2829974) (← links)
• Non-isometric Contextual Array Grammars with Regular Control and Local Selectors (Q2945879) (← 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 restarting automata with auxiliary symbols and small window size (Q5021113) (← links)
• On double-jumping finite automata and their closure properties (Q5223615) (← links)
• State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata (Q6095517) (← links)
• \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter (Q6177182) (← links)
• Reversible Two-Party Computations (Q6204131) (← links)
• State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters (Q6204134) (← links)
• On bidirectional deterministic finite automata (Q6666791) (← links)