adplus-dvertising
frame-decoration

Question

Find the wrong statement?

a.

The language accepted by finite automata are the languages denoted by regular expression

b.

Every DFA has a regular expression denoting its language

c.

For a regular expression r, there does not exist NFA with L(r) any transit that accept

d.

None of these

Answer: (c).For a regular expression r, there does not exist NFA with L(r) any transit that accept

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Find the wrong statement?

Similar Questions

Discover Related MCQs

Q. The behaviour of a NFA can be stimulated by DFA

Q. The relation between NFA-accepted languages and DFA accepted languages is

Q. The lexical analysis for a modern language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?

Q. What is the complement of the language accepted by the NFA shown below?
(Assume ∑ = {a} and ε is the empty string)

Q. Which one is a FALSE statement?

Q. Examine the following DFA: If input is 011100101, which edge is NOT traversed?

Q. If string s is accepted by this DFA, which of these strings cannot be suffix of s?

Q. The classes of languages P and NP are closed under certain operations, and not closed under others. Decide whether P and NP are closed under each of the following operations.

1. Union
2. Intersection
3. Intersection with a regular language
4. Kleene closure (star)
5. Homomorphism
6. Inverse homomorphism

Q. L1 is accepted by the NFA, obtained by changing the accepting state of M to a non-accepting state and vice versa. Which of the following statements is true?

Q. The number of states in DFA that accepts the language L(M) ∩ L(N) is ________.

Q. The reorganizing capability of NDFA and DFA

Q. Which of the following statement is true?

Q. Grammars that can be translated to DFAs :

Q. A language is regular if and only if it is accepted by finite automata

Q. A Push Down Automata _______________ is if there is at most one transition applicable to each configuration?

Q. The following mealy machine outputs which of the following?

Q. Which of the following does the given Mealy machine represents?

Q. Which of the following belongs to the epsilon closure set of a?

Q. The number of elements present in the e-closure(f2) in the given diagram:

Q. Which of the steps are non useful while eliminating the e-transitions for the given diagram?