Multiple Choice
Two strings x and y are indistinguishable if:
A) ?*(s, x) = ?* (s, y) , i.e. the state reached by a DFA M on input x is the same as the state reached by M on input y
B) if for every string z ? ?* either both xz and yz are in language A on ?* or both xz and yz are not in A
C) Both above statements are true
D) None of the above
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q15: Consider the following language L = {anbncndn
Q16: If G is a simple connected 3-regular
Q17: A spanning tree for a simple graph
Q18: If G is a simple connected 3-regular
Q19: The following grammar<br>G = (N, T, P,
Q21: Which of the following is not a
Q22: A Hamiltonian cycle in a Hamiltonian graph
Q23: The language accepted by a Push down
Q24: If G is "S ? a S/a",
Q25: The …………. is said to be ambiguous