The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+4 votes
37 views

State True of False

S1 :If L is regular,then the language = {uv u $\epsilon$ L ,v $\epsilon$ LR} is Regular.

S2:If w $\epsilon$ L, where L is regular than the language {wwR;w$\epsilon$ L} is Regular.

asked in Theory of Computation by Veteran (10.4k points) | 37 views

S2: If w ϵ L, where L is regular than the language {wwR;wϵ L} is Regular. is false  wwr is not Regular  but CFL.

S1: If L is regular,then the language = {uv |u ϵ L ,v ϵ LR} is Regular. Yes Regular 

Please log in or register to answer this question.



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

29,997 questions
37,682 answers
96,749 comments
35,329 users