The nondeterministic state complexity of the site-directed deletion language operation

DOI10.1016/j.tcs.2023.113999OpenAlexW4379614944MaRDI QIDQ6175008

Oliver A. S. Lyon, Kai Salomaa

Publication date: 21 July 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113999

zbMATH Keywords

descriptional complexitynondeterministic finite automatonbio-inspired operationsfooling set

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic applications of XPCR
• Deletion along trajectories
• Contextual insertions/deletions and computability
• Finite automata and unary languages
• 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: The nondeterministic state complexity of the site-directed deletion language operation