On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers

DOI10.1051/ita/2021007OpenAlexW3186521894MaRDI QIDQ5021109

Zita Kovács, Benedek Nagy

Publication date: 12 January 2022

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ita/2021007

zbMATH Keywords

finite-state transducers\(5' \rightarrow 3'\) WK automatasensing WK automataWatson-Crick transducers

Mathematics Subject Classification ID

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

Related Items (2)

Reversible Two-Party Computations ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the equivalence and complexity of linear grammars
• Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter
• On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
• Two-head finite-state acceptors with translucent letters
• On the descriptional complexity of Watson-Crick automata
• \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata
• On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
• Expressiveness of Streaming String Transducers
• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• Linear automata with translucent letters and linear context-free trace languages
• Computing by Observing: A Brief Survey
• Linear Context Free Languages
• On 5′→3′ Sensing Watson-Crick Finite Automata

This page was built for publication: On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers