edited by
405 views
0 votes
0 votes

Let the rotational closure of language $A$ be $RC(A) = \{yx| xy ∈ A\}.$

  1. Show that for any language $A,$ we have $RC(A) = RC(RC(A)).$
  2. Show that the class of regular languages is closed under rotational closure.
edited by

Please log in or register to answer this question.

Related questions

2 votes
2 votes
2 answers
2