The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

L={a^n b^n :n>=1} and R = (a+b)^*

L union R is going to be regular or not regular

plzz give reason L is not regular if N leads to infinity then how it can be regular ..........

L union R is going to be regular or not regular

plzz give reason L is not regular if N leads to infinity then how it can be regular ..........

+2 votes

Best answer

$L$ = {$ab,aabb,aaabbb,aaaabbbb....... $} $\Rightarrow DCFL$

$R$ = {$\epsilon, a ,b , aa,bb,ab,ba,aaa,bbb ,aabb,aaaabbbb,,,,,,,,$} $\Rightarrow Regular$

$L\cup R$ = {$\epsilon, a ,b , aa,bb,ab,ba,aaa,bbb ,aabb,aaaabbbb,,,,,,,,$} = $R$ $\Rightarrow Regular$

The thing is $R$ is a set of all strings over {$a,b$}. So $union$ of $R$ and $L$ is $R$ only. So it's regular.

$DCFL \cup Regular$ = $DCFL$ and Regular languages are subset of DCFL .

$R$ = {$\epsilon, a ,b , aa,bb,ab,ba,aaa,bbb ,aabb,aaaabbbb,,,,,,,,$} $\Rightarrow Regular$

$L\cup R$ = {$\epsilon, a ,b , aa,bb,ab,ba,aaa,bbb ,aabb,aaaabbbb,,,,,,,,$} = $R$ $\Rightarrow Regular$

The thing is $R$ is a set of all strings over {$a,b$}. So $union$ of $R$ and $L$ is $R$ only. So it's regular.

$DCFL \cup Regular$ = $DCFL$ and Regular languages are subset of DCFL .

- All categories
- General Aptitude 1.3k
- Engineering Mathematics 5.4k
- Digital Logic 2.1k
- Programming & DS 3.9k
- Algorithms 3.4k
- Theory of Computation 4.2k
- Compiler Design 1.6k
- Databases 3.1k
- CO & Architecture 2.7k
- Computer Networks 3.1k
- Non GATE 1.1k
- Others 1.4k
- Admissions 501
- Exam Queries 448
- Tier 1 Placement Questions 19
- Job Queries 62
- Projects 12

37,964 questions

45,466 answers

131,328 comments

48,380 users