Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case
type: Item
instance of: scholarly article
title: Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case
zbMATH Open document ID: 1251.68111
author: László Hegedüs
author: Benedek Nagy
author: Ömer Eğecioğlu
published in: Natural Computing
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6107173
zbMATH Keywords: Watson-Crick automata
zbMATH Keywords: counter machine
zbMATH Keywords: DNA computing
zbMATH Keywords: membrane computing
zbMATH Keywords: reversal bounded machine
zbMATH Keywords: stateless machine
zbMATH Keywords: universality
MaRDI profile type: Publication
full work available at URL: s11047-011-9290-9
OpenAlex ID: W2018485384
cites work: On Stateless Multicounter Machines
cites work: Q4263693
cites work: Q3862379
cites work: Hierarchies and Characterizations of Stateless Multicounter Machines
cites work: On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
cites work: ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
cites work: 5′ → 3′ Watson-Crick AutomataWith Several Runs
cites work: Q5590814
cites work: On 5′→3′ Sensing Watson-Crick Finite Automata
cites work: Q4223673
DOI: 10.1007/S11047-011-9290-9
description: scientific article; zbMATH DE number 6107173