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.2k
- Engineering Mathematics 4.7k
- Digital Logic 1.9k
- Programming & DS 3.5k
- Algorithms 3k
- Theory of Computation 3.7k
- Compiler Design 1.5k
- Databases 2.8k
- CO & Architecture 2.5k
- Computer Networks 2.9k
- Non GATE 837
- Others 1.2k
- Admissions 285
- Exam Queries 398
- Tier 1 Placement Questions 17
- Job Queries 51
- Projects 7

33,720 questions

40,265 answers

114,393 comments

38,904 users