Permutations of context-free and indexed languages

Abstract

We consider the cyclic closure of a language, and its generalisation to the operators $C^k$ introduced by Brandstädt. We prove that the cyclic closure of an indexed language is indexed, and that if $L$ is a context-free language then $C^k(L)$ is indexed.

13 pages, 5 figures