Permutations of context-free and indexed languages

preprint2015arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Permutations of context-free and indexed languages

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0