S2: If w ϵ L, where L is regular than the language {ww^{R};wϵ L} is Regular. is false ww^{r}^{ }is not Regular but CFL.

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

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+4 votes

State True of False

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

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

- All categories
- General Aptitude 1.3k
- Engineering Mathematics 5.2k
- Digital Logic 2k
- Programming & DS 3.7k
- Algorithms 3.2k
- Theory of Computation 4k
- Compiler Design 1.6k
- Databases 3k
- CO & Architecture 2.6k
- Computer Networks 3k
- Non GATE 1k
- Others 1.3k
- Admissions 486
- Exam Queries 435
- Tier 1 Placement Questions 18
- Job Queries 56
- Projects 9

36,171 questions

43,624 answers

124,024 comments

42,893 users