3
$\begingroup$

Given a context-free language $L$, define the language $p(L)$ as containing all permutations of strings in $L$ (i.e. all strings in $L$ such that the order of symbols is not important). Is $p(L)$ context-free?

I found two papers dealing with similar, but not identical, questions:

$\endgroup$
1
  • 1
    $\begingroup$ Have you tried applying the techniques shown in our reference question? $\endgroup$
    – Raphael
    Apr 15 '13 at 12:16
5
$\begingroup$

Start with simple context-free (or even regular) languages, and see what happens. For instance determine $p(L)$ for $L = (ab)^*$ and $L=(abc)^*$.

$\endgroup$
1
  • 1
    $\begingroup$ A penny just dropped in my head, thanks. $\endgroup$
    – Raphael
    Apr 15 '13 at 14:45

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.