most citedQuasi-deterministic 5' -> 3' Watson-Crick Automata

4 citations · 4 across the 1 of their papers we have counts for

collaborators
Showing cs.FLShow all

1 paper · 1 filter

cs.FL2022★ 4 cited

Quasi-deterministic 5' -> 3' Watson-Crick Automata

Benedek Nagy

Watson-Crick (WK) finite automata are working on a Watson-Crick tape, that is, on a DNA molecule. A double stranded DNA molecule contains two strands, each having a 5' and a 3' end…