M

Mr. Dubey • 85.33K Points
Coach 

Q. Which one of the following is the strongest correct statement about a finite language Lover a finite alphabet Σ?

(A) L is undecidable
(B) L is recursive
(C) L is a CSL
(D) L is a regular set
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.

Be the first to start discuss.

Related MCQs

Q. (1+1) ES

Q. Capacity is

Q. Overloaded functions

Q. is used to reset all the device controls to their startup state.

Q. The dual of one-to-all broadcast is?

Q. Which of the following is true for secure shell tunneling?

Q. When the state of object changes by internal operations, executing within the object it self, then these objects are referred as

Q. Which of the following can be an Ethernet physical address?

Q. Cancellation point is the point where

Q. Back propagation networks is

Question analytics