689 views

2 Answers

1 votes
1 votes
Consider 3 turing machine  each for A,B,C

from above problem it can be interpreted that any string w from $\sum_{ }^{*}$  can be accepted by exactly either A or B or C.

so

run  these 3 turing mahine on string w parallely

as we are sure that exactly one of them will accept so whenever any one TM accept that w then can simply say the other will reject and halt them

ex- if w is accepted by TMa  then we can halt TMb and TMc

it can be done for all the three TM's  so  A,B,C   all the three are decidable
0 votes
0 votes

 he saying that A,B,C are TURING RECOGNIZABLE that means they are RECURSIVELY ENUMARABLE .

NOW , RECURSIVELY ENUMARABLE .  are closed under  both UNION, INTERSECTION,

so,option D is correct 

i think he might be mistaken 

Related questions

2 votes
2 votes
1 answer
1
Na462 asked Sep 2, 2018
788 views
3 votes
3 votes
1 answer
3
Utkarsh Anand asked Jul 31, 2017
1,363 views
Are Turing decidable languages are closed under Complementation, Reversal, Homomorphism, Inverse Homomorphism and Substitution?
2 votes
2 votes
3 answers
4
srestha asked Jun 1, 2018
2,024 views
1)Let G be CFG. Whether L(G) is CFL.Q)Is it decidable or not?2)Let G be CFG and unambiguous. Whether L(G) is CFL.Q)Is it decidable or not?