Permutations of context-free and indexed languages
Abstract
We consider the cyclic closure of a language, and its generalisation to the operators Ck introduced by Brandst\"adt. We prove that the cyclic closure of an indexed language is indexed, and that if L is a context-free language then Ck(L) is indexed.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.