scientific article; zbMATH DE number 7444011

MaRDI QIDQ5016370zbMATH OpenFDO

Authors Benedek Nagy, Shaghayegh Parchami, Hamid Mir-Mohammad Sadeghi

Publication date 13 December 2021

Full work available at URL https://arxiv.org/abs/1708.06469, http://eptcs.web.cse.unsw.edu.au/paper.cgi?AFL2017.19

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Formal languages and automata (68Q45)

Recommendations

• On 5′→3′ Sensing Watson-Crick Finite Automata
• Deterministic sensing 5' 3' Watson-Crick automata without sensing parameter
• On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
• On deterministic 1-limited 5' 3' sensing Watson-Crick finite-state transducers
• On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
• 5' 3' Watson-Crick automata languages-without sensing parameter
• A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
• State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata
• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• Stateless multicounter 5' 3' Watson-Crick automata: the deterministic case

Cites work

• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• Developments in Language Theory
• DNA computing. New computing paradigms.
• scientific article; zbMATH DE number 5605080 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Marcus contextual grammars
• On 5′→3′ Sensing Watson-Crick Finite Automata
• On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages

Cited in

(16)

• Deterministic sensing 5' 3' Watson-Crick automata without sensing parameter
• On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
• \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata
• A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
• On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
• Linear automata with translucent letters and linear context-free trace languages
• On deterministic 1-limited 5' 3' sensing Watson-Crick finite-state transducers
• On string reading stateless multicounter \(5^{\prime} \rightarrow 3^{\prime}\) Watson-Crick automata (extended abstract)
• On 5′→3′ Sensing Watson-Crick Finite Automata
• State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata
• 5' 3' Watson-Crick automata languages-without sensing parameter
• Quasi-deterministic 5^ 3^ Watson-Crick automata
• Reversible Two-Party Computations
• State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters
• Quasi-deterministic finite one-head and two-head automata
• 5^ 3^ Watson-Crick automata accepting necklaces

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5016370)