adplus-dvertising
frame-decoration

Question

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?

a.

i, ii, iv

b.

i, ii, iii

c.

i, iv

d.

i, ii, iii, iv

Answer: (d).i, ii, iii, iv

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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?

Similar Questions

Discover Related MCQs

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?

Q. There exists a language L. We define a string w such that w∈L and w=xyz and |w| >=n for some constant integer n.What can be the maximum length of the substring xy i.e. |xy|<=?

Q. Fill in the blank in terms of p, where p is the maximum string length in L.
Statement: Finite languages trivially satisfy the pumping lemma by having n = ______

Q. Answer in accordance to the third and last statement in pumping lemma:
For all _______ xyiz ∈L

Q. Let w be a string and fragmented by three variable x, y, and z as per pumping lemma. What does these variables represent?

Q. Which of the following one can relate to the given statement:
Statement: If n items are put into m containers, with n>m, then atleast one container must contain more than one item.

Q. Which kind of proof is used to prove the regularity of a language?

Q. The language of balanced paranthesis is