Watson-Crick jumping finite automata
From MaRDI portal
Publication:5859652
DOI10.1142/S0129054120500331zbMATH Open1458.68107OpenAlexW4241910907MaRDI QIDQ5859652FDOQ5859652
Authors: Kalpana Mahalingam, U. K. Mishra, Rama Raghavan 
Publication date: 19 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054120500331
Recommendations
Watson-Crick automatajumping finite automataWatson-Crick jumping finite automataduplication operation
Cites Work
- Title not available (Why is that?)
- DNA computing, sticker systems, and universality
- The String-to-String Correction Problem
- Duplication in DNA Sequences
- Closure of Language Classes Under Bounded Duplication
- Operations and language generating devices suggested by the genome evolution
- On regularity of languages generated by copying systems
- Uniformly bounded duplication languages
- On the irregularity of the duplication closure
- Title not available (Why is that?)
- Aspects of Molecular Computing
- Title not available (Why is that?)
- Developments in Language Theory
- Jumping finite automata
- On basic properties of jumping finite automata
- One-way jumping finite automata
- Prefix-suffix duplication
- Bounded prefix-suffix duplication
- Duplications and pseudo-duplications
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)
