Hierarchy results on stateless multicounter 5′ → 3′ Watson-Crick automata

Authors:
Benedek Nagy;László Hegedüs;Ömer Eğecioğlu
Affiliations:
Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary;Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary;Department of Computer Science, University of California, Santa Barbara, CA
Venue:
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
Year:
2011

Citing 7
Cited 4

Computing with membranes

Journal of Computer and System Sciences
Computation: finite and infinite machines

Computation: finite and infinite machines
Hierarchies and Characterizations of Stateless Multicounter Machines

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On Stateless Multicounter Machines

CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
On 5' → 3' sensing Watson-Crick finite automata

DNA13'07 Proceedings of the 13th international conference on DNA computing
On stateless multihead automata: hierarchies and the emptiness problem

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
5′ → 3′ Watson-Crick Automata With Several Runs

Fundamenta Informaticae - Non-Classical Models of Automata and Applications

Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
An infinite hierarchy of language families resulting from stateless pushdown automata with limited pushdown alphabets

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
A Survey of Results on Stateless Multicounter Automata

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Stateless multicounter 5' → 3' Watson---Crick automata: the deterministic case

Natural Computing: an international journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider stateless counter machines which mix the features of one-head counter machines and a special type of two-head Watson-Crick automata (WK-automata). Our biologically motivated machines have heads that read the input starting from the two extremes. The reading process is finished when there are no more symbols between the heads. Depending on whether the heads are required to advance at each move, we distinguish between realtime and non-realtime machines. If every counter makes at most k alternations between nondecreasing and decreasing modes in every computation, then the machine is k-reversal. In this paper we concentrate on the properties of nondeterministic stateless WK-automata with counters. Results about deterministic versions can be found in (Eğecioğlu et al.: Stateless multicounter 5′ → 3′ Watson-Crick Automata, BIC-TA 2010).