The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+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

asked in Theory of Computation by Veteran (15.7k points)
edited by | 38 views

1 Answer

+1 vote

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.


answered by Active (1.7k points)

Related questions

0 votes
0 answers
asked Feb 25 in Theory of Computation by shivanisrivarshini Veteran (15.7k points) | 72 views
0 votes
1 answer
asked Aug 14, 2015 in Theory of Computation by Shefali Active (1.5k points) | 205 views
0 votes
0 answers
asked Dec 10, 2017 in Theory of Computation by set2018 Boss (8.7k points) | 74 views

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

34,256 questions
40,959 answers
39,868 users