Decision Problems on Copying and ShufflingArticle
Authors: Vesa Halava ; Tero Harju ; Dirk Nowotka ; Esa Sahla
NULL##NULL##NULL##NULL
Vesa Halava;Tero Harju;Dirk Nowotka;Esa Sahla
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.
Volume: Volume 191, Issues 3-4: Iiro Honkala's 60 Birthday
Published on: November 10, 2024
Accepted on: December 7, 2023
Submitted on: February 14, 2023
Keywords: Computer Science - Formal Languages and Automata Theory, 68Q45, 68Q42, 03D35, F.4.3, F.4.1