Closure of Language Classes Under Bounded Duplication
From MaRDI portal
Publication:3617061
DOI10.1007/11779148_22zbMath1227.68058OpenAlexW1500388232MaRDI QIDQ3617061
Peter Leupold, Masami Ito, Kayoko Shikishima-Tsuji
Publication date: 26 March 2009
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11779148_22
Related Items (12)
Prefix-suffix square reduction ⋮ Tandem Duplications, Segmental Duplications and Deletions, and Their Applications ⋮ Duplications and Pseudo-Duplications ⋮ Duplication in DNA Sequences ⋮ On Regularity-Preservation by String-Rewriting Systems ⋮ Non-overlapping inversion on strings and languages ⋮ General Idempotency Languages Over Small Alphabets ⋮ On the Prefix–Suffix Duplication Reduction ⋮ Bound-decreasing duplication system ⋮ Watson–Crick Jumping Finite Automata ⋮ Computing the Tandem Duplication Distance is NP-Hard ⋮ The tandem duplication distance problem is hard over bounded alphabets
This page was built for publication: Closure of Language Classes Under Bounded Duplication
