edited by
260 views
0 votes
0 votes
Is intersction of two languages is also a language of the same type?

RE AND REC

which languages is decidable and un undecidable
edited by

2 Answers

0 votes
0 votes
intersection of {} which is regular and {a^p|p is prime}which is csl is null which is will know regular.

 

Rec means decidable

RE is undecidable
0 votes
0 votes
No, intersection of two language may or may not be same language of same type .

Ex:

L1= a^nb^nc^m

L2= a^mb^mc^m

L1 intersection L2 = a^nb^nc^n which is csl

Related questions

0 votes
0 votes
0 answers
1
amit166 asked Jan 20, 2019
349 views
L={${a^{n}b^{n}ca^{n}b^{n}| n>=0}$}L={${a^{n}b^{m}ca^{n}b^{m}| n>=0},m>=0$}