edited by
477 views
2 votes
2 votes

1. For Recursive enumerable languages , we can not draw state diagram

2. CFL is closed under Complement , By making accepting states as rejecting states and vice versa

3. L = { ap | p is prime number } is recursive enumerable language

4. If a language is closed under complement,union then it is closed under intersection

     since (L1' ∪ L2')' = L1 ∩ L2

edited by

1 Answer

1 votes
1 votes

A) Recursive Enumerable language have Turing Machine.So ofcourse we can draw state transition diagram. 

B)CFL is not closed under complementation.

C) It is CSL so, RE too.

D)True.

Related questions

0 votes
0 votes
0 answers
1
shivanisrivarshini asked Feb 24, 2018
515 views
1. $L' = \sum^*−L$ for any language $L$2. $L=\{a^ma^nb^n\mid m>0 , n>0 \}$ is DCFL3. If a language is closed under complement,difference then it is closed under inters...
0 votes
0 votes
1 answer
2
Shefali asked Aug 14, 2015
1,566 views
(a) If $R$ is regular and $N$ is non-regular, then there exists $R+N$, which is regular.(b) If $R$ is regular and $N$ is non-regular, then there exists $R+N$, which is no...
0 votes
0 votes
0 answers
3
Sanjay Sharma asked Apr 25, 2018
6,022 views
Q Suppose T1(N) = O (f (N)) and T2(N) = O (f (N)).Which of the following statements are true in general? (a) T1(N) + T2(N) = O (f (n)) (b) T1(N) − T2(N) = o (f (n)) (c...
1 votes
1 votes
1 answer
4
Rohan Mundhey asked Nov 5, 2016
1,384 views