3,087 views
1 1 vote

1 Answer

0 0 votes
It will be easy to remember only the not closed once. If you consider only Reg CFL Recursive Recursive enumerable and all basic property then only cfl not closed under intersection and complementation and RE is not closed under complementation.
Position:
Show:

Related questions

2 2 votes
2 answers 2 answers
3.1k
3.1k views
shikharV asked Nov 14, 2015
3,099 views
I want to know how to remember which language is decidable for which property. Should I go through the proofs or should I remember everything?
0 0 votes
0 0 answers
648
648 views
Iqra Javed asked Jul 21, 2023
648 views
Construct a BCD-to-excess-3-code converter with a 4-bit adder. Remember that the excess-3 code digit is obtained by adding three to the corresponding BCD digit. What mus...
0 0 votes
2 2 answers
2.7k
2.7k views
aayushranjan01 asked May 20, 2015
2,684 views
I want to know the best way through which we can find transitive closures of any relation ? Please let me know.
3 3 votes
1 1 answer
10.4k
10.4k views
shekhar chauhan asked Apr 25, 2016
10,401 views
https://gateoverflow.in/?qa=blob&qa_blobid=8929616163903734815