Pages that link to "Item:Q3617061"
From MaRDI portal
The following pages link to Closure of Language Classes Under Bounded Duplication (Q3617061):
Displaying 12 items.
- Non-overlapping inversion on strings and languages (Q500959) (← links)
- The tandem duplication distance problem is hard over bounded alphabets (Q2115851) (← links)
- Bound-decreasing duplication system (Q2326408) (← links)
- Prefix-suffix square reduction (Q2358680) (← links)
- Duplications and Pseudo-Duplications (Q2945563) (← links)
- Duplication in DNA Sequences (Q3533029) (← links)
- On Regularity-Preservation by String-Rewriting Systems (Q3540126) (← links)
- Computing the Tandem Duplication Distance is NP-Hard (Q5020832) (← links)
- Tandem Duplications, Segmental Duplications and Deletions, and Their Applications (Q5042229) (← links)
- On the Prefix–Suffix Duplication Reduction (Q5217116) (← links)
- General Idempotency Languages Over Small Alphabets (Q5740529) (← links)
- Watson–Crick Jumping Finite Automata (Q5859652) (← links)
