\( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata

DOI10.1016/j.ins.2020.06.031zbMath1474.68180OpenAlexW3036390024MaRDI QIDQ2666842

Benedek Nagy

Publication date: 23 November 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2020.06.031

zbMATH Keywords

formal languagesclosure propertiesnatural computingpumping lemmapushdown automatastateless automatamildly context-sensitive languagesDNA-computingWK-automata

Mathematics Subject Classification ID

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

Related Items (4)

State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata ⋮ \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter ⋮ Reversible Two-Party Computations ⋮ On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Membership for growing context-sensitive grammars is polynomial
• Remarks on multihead pushdown automata and multihead stack automata
• Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case
• Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter
• Formal languages and applications.
• On two-way multihead automata
• On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages
• Handbook of Natural Computing
• On growing context-sensitive languages
• On String Reading Stateless Multicounter 5′ → 3′ Watson-Crick Automata
• On 5′→3′ Sensing Watson-Crick Finite Automata
• On Context-Free Languages
• Multi-tape and multi-head pushdown automata
• Developments in Language Theory

This page was built for publication: \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata