Journal of Computer and System Sciences
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Computation: finite and infinite machines
Computation: finite and infinite machines
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Simple deterministic languages
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
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
Hierarchy results on stateless multicounter 5′ → 3′ Watson-Crick automata
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
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
| Hi-index | 0.00 |
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 Watson-Crick counter machines are biologically motivated. They have two heads that read the input starting from the two extremes. The reading process is finished when there are no more symbols between the heads, i.e., every letter of the input is processed by either head. 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. It is reversal bounded if it is k-reversal for some k. In this paper we concentrate on the properties of both deterministic and nondeterministic stateless WK-automata with reversal bounded counters.