Register

Formal Languages

• reshown by
735 views

1 Answer

Best answer
1 1 vote
Actually the language L is CFL, and we know that CFL are not closed under Compliment and Intersection.

So compliment of given language will be CSL.
• selected by
Voting & Accepting an answer helps improve the community
← Previous · MeTest-MOCK2Next → · Gate cs 2017
← Previous in category · Context free languag...Next in category → · Context Free Languag...
Position:
Show:

Related questions

0 0 votes
0 0 answers
810
810 views
Silver_Reaper asked Feb 6, 2023
810 views
An Introduction to Formal Languages and Automata,Peter Linz,6th edition,exercise 3.3 q3
Find a regular grammar that generates the language L (aa ∗ (ab + a) ∗ ).
1 1 vote
0 0 answers
788
788 views
Sambhrant Maurya asked Oct 14, 2018
788 views
Formal Languages
Let r1 = (b*ab*ab*ab*)* and r2= (b*ab*ab*)*. What is L(r1) ∩ L(r2)?a) L[b*ab*ab*ab*)*]b) L[b*ab*ab*)*]c) L[b*ab*ab*)6]d) L[b*ab*ab*ab*ab*ab*ab*)*]
0 0 votes
0 0 answers
688
688 views
Sambhrant Maurya asked Oct 14, 2018
688 views
Formal Languages
Let r1= (a+b2)* , r2 = (a* + b*)* , r3 = (a2 + b)*Which of the following is true?a)L(r1) is a subset of L(r2) and L(r3) is a subset of L(r2)b)L(r2) is a subset of L(r1) ...
0 0 votes
1 answers 1 answer
1.6k
1.6k views
Sambhrant Maurya asked Oct 14, 2018
1,627 views
Formal Languages
If G= ({S} , {a}, {S ->SS} , S), then language L(G) isa)ϕb)aa(a)*c)(aa)*d)None of these