adplus-dvertising
frame-decoration

Question

If d is a final state, which of the following is correct according to the given diagram?

a.

x=p, y=qr, z=s

b.

x=p, z=qrs

c.

x=pr, y=r, z=s

d.

All of the mentioned

Answer: (a).x=p, y=qr, z=s

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If d is a final state, which of the following is correct according to the given diagram?

Similar Questions

Discover Related MCQs

Q. Let h(0)=ab; h(1)=e
Let L={abab,baba}
h-1(L)=_______

Q. While proving Inverse Homomorphism, which of the following steps are needed?

Q. Let h(0)=ab; h(1)=e
Let L={abab,baba}
h-1(L)= the language of two zeroes and any number of one’s.
The given example belongs to which of the following?

Q. If a DFA has n states and the language contains any string of length n or more, the language is termed as:

Q. State true or false:
Statement: If an n-state DFA accepts a string w of length n or more, then there must be a state that appears twice on the path labeled w from the start state to the final state.

Q. Which of the following is true?

Q. All the regular languages can have one or more of the following descriptions:

i) DFA
ii) NFA
iii) e-NFA
iv) Regular Expressions

Which of the following are correct?

Q. Which of the technique can be used to prove that a language is non regular?

Q. Which of the following language regular?

Q. Which of the following are non regular?

Q. If L is DFA-regular, L’ is

Q. Which of the following options is incorrect?

Q. Myphill Nerode does the following:

Q. Which of the following are related to tree automaton?

Q. Given languages:
i) {a^nb^n|n>=0}

ii) <div>n</div>n

iii) {w∈{a,b}∗| #a(w)=#b(w)}, # represents occurrences

Which of the following is/are non regular?

Q. Finite state machine are not able to recognize Palindromes because:

Q. Relate the following statement:
Statement: All sufficiently long words in a regular language can have a middle section of words repeated a number of times to produce a new word which also lies within the same language.

Q. While applying Pumping lemma over a language, we consider a string w that belong to L and fragment it into _________ parts.

Q. If we select a string w such that w∈L, and w=xyz. Which of the following portions cannot be an empty string?

Q. Let w= xyz and y refers to the middle portion and |y|>0.What do we call the process of repeating y 0 or more times before checking that they still belong to the language L or not?