Permutations of context-free, ET0L and indexed languages

Tara Brough, Laura Ciobanu, Murray Elder +1

For a language $L$, we consider its cyclic closure, and more generally the language $C^k(L)$, which consists of all words obtained by partitioning words from $L$ into $k$ factors a…