Site-directed insertion: language equations and decision problems
From MaRDI portal
Publication:2334603
DOI10.1016/J.TCS.2019.04.019zbMATH Open1435.68151OpenAlexW2945197839WikidataQ127839291 ScholiaQ127839291MaRDI QIDQ2334603FDOQ2334603
Kai Salomaa, Taylor J. Smith, Yo-Sub Han, Da-Jung Cho
Publication date: 7 November 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.04.019
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear computation of unbordered conjugate on unordered alphabet
- On language equations with invertible operations
- A Second Course in Formal Languages and Automata Theory
- Shuffle on trajectories: Syntactic constraints
- Trajectory-based codes
- Intersection and union of regular languages and state complexity
- Self-assembly of strings and languages
- A formal language model of DNA polymerase enzymatic activity
- Algorithmic applications of XPCR
- Contextual insertions/deletions and computability
- Aspects of shuffle and deletion on trajectories
- Site-directed insertion: decision problems, maximality and minimality
- The chop of languages
- Developments in Language Theory
- On the overlap assembly of strings and languages
- State complexity of overlap assembly
- Outfix-guided insertion
- State Complexity of Insertion
- Descriptional Complexity of Chop Operations on Unary and Finite Languages.
Cited In (3)
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)
