Closure of Language Classes Under Bounded Duplication
From MaRDI portal
Recommendations
Cited in
(22)- The tandem duplication distance problem is hard over bounded alphabets
- On decidability and closure properties of language classes with respect to bio-operations
- Bound-decreasing duplication system
- Prefix-suffix square reduction
- Duplications and pseudo-duplications
- Bounded prefix-suffix duplication
- Uniformly bounded duplication codes
- Duplication in DNA Sequences
- On Regularity-Preservation by String-Rewriting Systems
- scientific article; zbMATH DE number 3919849 (Why is no real title available?)
- Closure Properties of Certain Classes of Languages under Generalized Morphic Replication
- scientific article; zbMATH DE number 17829 (Why is no real title available?)
- scientific article; zbMATH DE number 1355000 (Why is no real title available?)
- Non-overlapping inversion on strings and languages
- Computing the tandem duplication distance is NP-hard
- Tandem Duplications, Segmental Duplications and Deletions, and Their Applications
- On the prefix-suffix duplication reduction
- scientific article; zbMATH DE number 6606340 (Why is no real title available?)
- General idempotency languages over small alphabets
- Bounded prefix-suffix duplication: language theoretic and algorithmic results
- Watson-Crick jumping finite automata
- Languages generated by iterated idempotency
This page was built for publication: Closure of Language Classes Under Bounded Duplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617061)
