Decision Problems on Copying and Shuffling
Formal Languages and Automata Theory
2026-04-08 v4
Abstract
We study decision problems of the form: given a regular or linear context-free language , is there a word of a given fixed form in , where given fixed forms are based on word operations copy, marked copy, shuffle and their combinations.
Keywords
Cite
@article{arxiv.2302.06248,
title = {Decision Problems on Copying and Shuffling},
author = {Vesa Halava and Tero Harju and Dirk Nowotka and Esa Sahla},
journal= {arXiv preprint arXiv:2302.06248},
year = {2026}
}