State complexity of deletion and bipolar deletion
It is well known that the language obtained by deleting an arbitrary language from a regular
language is regular. We give an upper bound for the state complexity of deleting an arbitrary …
language is regular. We give an upper bound for the state complexity of deleting an arbitrary …
Site-directed deletion
We introduce a new bio-inspired operation called a site-directed deletion motivated from site-
directed mutagenesis performed by enzymatic activity of DNA polymerase: Given two strings …
directed mutagenesis performed by enzymatic activity of DNA polymerase: Given two strings …
[HTML][HTML] Site-directed insertion: Language equations and decision problems
Site-directed insertion is an overlap** insertion operation that can be viewed as
analogous to the overlap assembly or chop operations that concatenate strings by …
analogous to the overlap assembly or chop operations that concatenate strings by …
The nondeterministic state complexity of the site-directed deletion language operation
Site-directed deletion is a language operation inspired by the laboratory procedures
entailed by polymerase chain reaction. Site-directed deletion contextually removes a …
entailed by polymerase chain reaction. Site-directed deletion contextually removes a …
Nondeterministic state complexity of site-directed deletion
Site-directed deletion is a biologically inspired operation that removes a contiguous
substring from the host string guided by a template string. The template string must match …
substring from the host string guided by a template string. The template string must match …
Further closure properties of input-driven pushdown automata
A Okhotin, K Salomaa - … Conference on Descriptional Complexity of Formal …, 2018 - Springer
The paper investigates the closure of the language family defined by input-driven pushdown
automata (IDPDA) under the following operations: insertion ins (L, K)={xyz ∣ xz ∈ L,\, y ∈ …
automata (IDPDA) under the following operations: insertion ins (L, K)={xyz ∣ xz ∈ L,\, y ∈ …
Site-directed insertion: decision problems, maximality and minimality
Site-directed insertion is an overlap** insertion operation that can be viewed as
analogous to the overlap assembly or chop operations that concatenate strings by …
analogous to the overlap assembly or chop operations that concatenate strings by …
Nondeterministic State Complexity of Site-Directed Insertion.
Site-directed insertion (aka outfix-guided insertion) is a controlled insertion operation where
an outfix of the inserted string has to match a substring of the target string. We show that if L< …
an outfix of the inserted string has to match a substring of the target string. We show that if L< …
[HTML][HTML] Further closure properties of input-driven pushdown automata
A Okhotin, K Salomaa - Theoretical Computer Science, 2019 - Elsevier
The paper investigates the closure of the language family defined by input-driven pushdown
automata (IDPDA) under the following operations: insertion ins (L, K)={xyz| xz∈ L, y∈ K} …
automata (IDPDA) under the following operations: insertion ins (L, K)={xyz| xz∈ L, y∈ K} …
NONDETERMINISTIC STATE COMPLEXITY OF SITE-DIRECTED INSERTION
OASLAK Salomaa - jalc.de
Site-directed insertion (aka outfix-guided insertion) is a controlled insertion operation where
an outfix of the inserted string has to match a substring of the target string. We show that if L1 …
an outfix of the inserted string has to match a substring of the target string. We show that if L1 …