Permutations of context-free and indexed languages
Brough, Tara · Ciobanu, Laura · Elder, Murray
Original · EN
We consider the cyclic closure of a language, and its generalisation to the operators Cᵏ 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ᵏ(L) is indexed.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.