scientific article; zbMATH DE number 7444011

zbMath1483.68178arXiv1708.06469MaRDI QIDQ5016370

Benedek Nagy, Hamid Mir-Mohammad Sadeghi, Shaghayegh Parchami

Publication date: 13 December 2021

Full work available at URL: https://arxiv.org/abs/1708.06469

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (10)

\( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata ⋮ A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model ⋮ State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata ⋮ \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter ⋮ Reversible Two-Party Computations ⋮ State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters ⋮ Unnamed Item ⋮ Linear automata with translucent letters and linear context-free trace languages ⋮ 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

Cites Work

• Marcus contextual grammars
• DNA computing. New computing paradigms.
• On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• On 5′→3′ Sensing Watson-Crick Finite Automata
• Developments in Language Theory
• Unnamed Item
• Unnamed Item

This page was built for publication: