Permutations of context-free and indexed languages
classification
💻 cs.FL
keywords
indexedlanguageclosurecontext-freecyclicbrandstconsidergeneralisation
read the original abstract
We consider the cyclic closure of a language, and its generalisation to the operators $C^k$ 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 $C^k(L)$ is indexed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.