in Theory of Computation edited by
408 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.
in Theory of Computation edited by
by
408 views

Please log in or register to answer this question.

Related questions