Site-directed insertion: language equations and decision problems
From MaRDI portal
Publication:2334603
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- A Second Course in Formal Languages and Automata Theory
- A formal language model of DNA polymerase enzymatic activity
- Algorithmic applications of XPCR
- Aspects of shuffle and deletion on trajectories
- Contextual insertions/deletions and computability
- Descriptional complexity of chop operations on unary and finite languages
- Developments in Language Theory
- Interpreted trajectories
- Intersection and union of regular languages and state complexity
- Linear computation of unbordered conjugate on unordered alphabet
- On language equations with invertible operations
- On the overlap assembly of strings and languages
- Outfix-guided insertion
- Self-assembly of strings and languages
- Shuffle on trajectories: Syntactic constraints
- Site-directed insertion: decision problems, maximality and minimality
- State complexity of insertion
- State complexity of overlap assembly
- The chop of languages
- Trajectory-based codes
Cited in
(7)- Outfix-guided insertion (extended abstract)
- Site-directed insertion: decision problems, maximality and minimality
- Site-directed deletion
- Outfix-guided insertion
- The nondeterministic state complexity of the site-directed deletion language operation
- scientific article; zbMATH DE number 7584602 (Why is no real title available?)
- Nondeterministic state complexity of site-directed deletion
This page was built for publication: Site-directed insertion: language equations and decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334603)