M

Mr. Dubey • 100.69K Points
Coach

Q. Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, but not recursive, language. Which one of the following statements is false?

  • (A) L1 n L2 is a deterministic CFL
  • (B) L3 n L1 is recursive
  • (C) L1 U L2 is context free
  • (D) L1 n L2 n L3 is recursively enumerable
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The addresses of class B network has subnet mask of .

Q. A frequent pattern tree is a tree structure consisting of ________

Q. The architecture that uses a tighter coupling between the compiler and the processor is

Q. is a combination of two of more attributes used as a primary key

Q. Which of the following is not an element of directing?

Q. Decision Nodes are represented by

Q. Which of the following is another name for a weak entity?

Q. Which multicast address does the OSPF Hello protocol use?

Q. The device that is required to translate digital signals into analogue form and

Q. A persona in the context of goa- oriented interaction design ………..

Question analytics