If string s is accepted by this DFA, which of these strings cannot be – McqOptions

MCQOPTIONS

1.	If string s is accepted by this DFA, which of these strings cannot be suffix of s?
A.	111001
B.	111111
C.	111000
D.	101010
Answer» B. 111111

Discussion

No Comment Found

Related MCQs

For the following grammar: S → A | B | 2 A → C0 | D B → C1 | E C → D | E | 3 D → E0 | S E → D1 | S Identify all the unit pairs.
The grammar G: S → SS | a | b is ambiguous. Check all and only the strings that have exactly two leftmost derivations in G.
The parse tree below represents a rightmost derivation according to the grammar S → AB, A → aS|a, B → bA. Which of the following are right-sentential forms corresponding to this derivation?
Here is a context-free grammar G: S → AB A → 0A1 | 2 B → 1B | 3A which of the following strings are in L (G)?
If is a language, and is a symbol, then, the quotient of and, is the set of strings such that is in: is in. Suppose is regular, which of the following statements is true?
Which grammar is not regular?
Which of the following strings is NOT in the Kleene star of the language {011, 10, 110}?
Find the pair of regular expressions that are equivalent.
If string s is accepted by this DFA, which of these strings cannot be suffix of s?
Examine the following DFA: If input is 011100101, which edge is NOT traversed?