Nondeterministic state complexity of site-directed deletion

DOI10.1007/978-3-031-07469-1_15MaRDI QIDQ2164749zbMATH OpenOpenAlexFDO

Authors Oliver A. S. Lyon, Kai Salomaa

Publication date 16 August 2022

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

zbMATH Keywords

bio-inspired operationsdescriptional complexityfooling setnondeterministic finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Algorithmic applications of XPCR
• Computing by polymerase chain reaction
• Contextual insertions/deletions and computability
• Deletion along trajectories
• DNA computing. New computing paradigms.
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1953225 (Why is no real title available?)
• Insertion and deletion closure of languages
• Intersection and union of regular languages and state complexity
• Outfix-guided insertion
• Site-directed deletion
• Site-directed insertion: language equations and decision problems
• State complexity of deletion and bipolar deletion
• State complexity of insertion

Cited in

(2)

• State Complexity of Deletion
• The nondeterministic state complexity of the site-directed deletion language operation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2164749)