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

M

Mr. Dubey • 52.48K 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

Correct Answer - Option(D)
Views: 123
Filed under category Theory of Computation

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. Which is not part of emitter-coupled logic (ECL)?

Q. SP stands for:

Q. What are the types of requirement in Quality Function Deployment(QFD) ?

Q. If the state of the database no longer reﬂects a real state of the world that the database is supposed to capture, then such a state is called

Q. How many common operations are performed in a binary tree?

Q. Cartesian product in relational algebra is

Q. If the peak message signal amplitude is half the peak amplitude of the carrier signal, the signal is modulated.

Q. The GridView control in ASP.NET has which of the following features

Q. A ____ database state is one in which all data integrity constraints are satisfied.

Q. Turbo codes are

Question analytics