Watson–Crick Jumping Finite Automata

DOI10.1142/S0129054120500331zbMath1458.68107OpenAlexW4241910907MaRDI QIDQ5859652

Ujjwal Kumar Mishra, Kalpana Mahalingam, 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

zbMATH Keywords

Watson-Crick automatajumping finite automataWatson-Crick jumping finite automataduplication operation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regularity of languages generated by copying systems
• DNA computing, sticker systems, and universality
• Uniformly bounded duplication languages
• Prefix-suffix duplication
• Duplications and Pseudo-Duplications
• Bounded Prefix-Suffix Duplication
• Duplication in DNA Sequences
• Closure of Language Classes Under Bounded Duplication
• The String-to-String Correction Problem
• On Basic Properties of Jumping Finite Automata
• JUMPING FINITE AUTOMATA
• Developments in Language Theory
• One-Way Jumping Finite Automata
• Aspects of Molecular Computing
• Operations and language generating devices suggested by the genome evolution

This page was built for publication: Watson–Crick Jumping Finite Automata