The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
35 views

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}.$
in Theory of Computation by Veteran (51.1k points)
edited by | 35 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,339 questions
55,765 answers
192,354 comments
90,815 users