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

View solution

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.

View solution

Q. Which of the following is true?

View solution

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?

View solution

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

View solution

Q. Which of the following language regular?

View solution

Q. Which of the following are non regular?

View solution

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

View solution

Q. Which of the following options is incorrect?

View solution

Q. Myphill Nerode does the following:

View solution

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

View solution

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?

View solution

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

View solution

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.

View solution

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

View solution

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

View solution

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?

View solution

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|<=?

View solution

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 = ______

View solution

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

View solution