Decision Problems on Copying and Shuffling

TL;DR

This paper investigates decision problems related to the existence of words with specific forms within regular or linear context-free languages, focusing on operations like copying, marking, and shuffling.

Contribution

It introduces new decision problems involving word operations and analyzes their computational properties within formal language classes.

Findings

Identifies decidability boundaries for copying and shuffling operations.

Provides complexity results for specific decision problems.

Establishes connections between language classes and operation-based decision problems.

Abstract

We study decision problems of the form: given a regular or linear context-free language $L$, is there a word of a given fixed form in $L$, where given fixed forms are based on word operations copy, marked copy, shuffle and their combinations.