edited by
516 views
0 votes
0 votes

In the traditional method for cutting a deck of playing cards, the deck is arbitrarily split two parts, which are exchanged beforereassembling the deck. In a more complex cut, called $\text{Scarne’s cut,}$ the deck is broken into three parts and the middle part in placed first in the reassembly. We’ll take $\text{Scarne’s cut}$ as the inspiration for an operation on languages$.$ For a language $A,$ let $\text{CUT(A) = {yxz| xyz ∈ A}}.$                     

  1. Exhibit a language $B$ for which $\text{CUT(B)$\neq$ CUT(CUT(B)).}$
  2. Show that the class of regular languages is closed under $\text{CUT}.$
edited by

Please log in or register to answer this question.

Related questions

2 votes
2 votes
2 answers
2
0 votes
0 votes
0 answers
4