Watson-Crick jumping finite automata
From MaRDI portal
Publication:5859652
Recommendations
Cites work
- scientific article; zbMATH DE number 1236223 (Why is no real title available?)
- scientific article; zbMATH DE number 1342112 (Why is no real title available?)
- scientific article; zbMATH DE number 1407503 (Why is no real title available?)
- Aspects of Molecular Computing
- Bounded prefix-suffix duplication
- Closure of Language Classes Under Bounded Duplication
- DNA computing, sticker systems, and universality
- Developments in Language Theory
- Duplication in DNA Sequences
- Duplications and pseudo-duplications
- Jumping finite automata
- On basic properties of jumping finite automata
- On regularity of languages generated by copying systems
- On the irregularity of the duplication closure
- One-way jumping finite automata
- Operations and language generating devices suggested by the genome evolution
- Prefix-suffix duplication
- The String-to-String Correction Problem
- Uniformly bounded duplication languages
Cited in
(4)
This page was built for publication: Watson-Crick jumping finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859652)