1,362 views

1 Answer

0 votes
0 votes

Turing decidable languages also called Recursive lanuages, are closed under

-Union

-Intersection

-Complement

-Reversal

-Kleene star

-Concatenation

-Homomorphism,

-Inverse Homomorphism 

Related questions

2 votes
2 votes
1 answer
1
Na462 asked Sep 2, 2018
788 views
1 votes
1 votes
2 answers
3
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?