Nondeterministic state complexity of site-directed deletion

DOI10.1007/978-3-031-07469-1_15OpenAlexW4285153081MaRDI QIDQ2164749

Kai Salomaa, Oliver A. S. Lyon

Publication date: 16 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07469-1_15

zbMATH Keywords

descriptional complexitynondeterministic finite automatonbio-inspired operationsfooling set

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithmic applications of XPCR
• Deletion along trajectories
• Contextual insertions/deletions and computability
• Intersection and union of regular languages and state complexity
• Insertion and deletion closure of languages
• Site-directed deletion
• Outfix-guided insertion
• DNA computing. New computing paradigms.
• Site-directed insertion: language equations and decision problems
• Computing by polymerase chain reaction
• State Complexity of Insertion
• State complexity of deletion and bipolar deletion

This page was built for publication: Nondeterministic state complexity of site-directed deletion