Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?

Mr. Dubey • 87.94K Points
Coach

Q. Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?

(A) n-1

(B) n

(D) 2n-1

Correct Answer - Option(C)
Views: 681
Filed under category Theory of Computation and Compiler Design

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

You must be Logged in to update hint/solution

Discusssion

Loading Comments....

Q. Discovery of cross-sales opportunities is called _________.

Q. The PSTN is an example of a ………………… network.

Q. Which of the following properties is associated with a queue?

Q. An RPC (remote procedure call) is initiated by the _________

Q. What is the source?

Q. Which of the following are decidable? I. Whether the intersection of two regular languages is infinite II. Whether a given context-free language is re

Q. A CASE SQL statement is which of the following?

Q. A formula consisting of disjunctions of min-terms is called _________.

Q. "An informal narrative description of human activities or tasks in a story that allows exploration and discussion of contexts, needs, and require

Q. Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?

Discusssion

Related MCQs

Question analytics