On 5' → 3' sensing Watson-Crick finite automata

Authors:
Benedek Nagy
Affiliations:
Faculty of Informatics, University of Debrecen, Hungary and GRLMC, Rovira i Virgili University, Tarragona, Spain
Venue:
DNA13'07 Proceedings of the 13th international conference on DNA computing
Year:
2007

Citing 3
Cited 5

On one-way two-head deterministic finite state automata

Computers and Artificial Intelligence
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Watson-Crick ω-automata

Journal of Automata, Languages and Combinatorics

5′ → 3′ Watson-Crick Automata With Several Runs

Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Two-party Watson-Crick computations

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
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
Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Stateless multicounter 5' → 3' Watson---Crick automata: the deterministic case

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a variation of Watson-Crick automata in which both heads read the doubled DNA strand form 5' to 3'. The sensing version of these automata recognize exactly the linear context-free languages. The deterministic version is not so powerful, but all fixed-rated linear (for instance even-linear) languages can be accepted by them. Relation to other variations of Watson-Crick automata and pushdown automata are presented. The full-reading version of sensing 5′ → 3′ automata recognizes non context-free languages as well.