The Gateway to Computer Science Excellence
0 votes
19 views
Show that the regular languages are closed under the following operation$:$ $\text{cycle(L)={we can write w as w = xy,such that yx is in L}}.$ For example if $L=\{01,011\},$then $cycle(L)=\{01,10,011,110,101\}.$  Hint$:$ Start with a DFA for $L$ and construct an $\in-NFA$ for $cycle(L).$
in Theory of Computation by Veteran (60.6k points) | 19 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,833 questions
57,713 answers
199,427 comments
107,655 users