www-ai.cs.tu-dortmund.de/de/LEHRE/SEMINARE/WS2122/TrustworthyAIMachineLearning/weiss2018a.pdf
returns a new partitioning p′ satisfying:
1. ∀h1 ∈ H , p′(h) 6= p′(h1), and
2. ∀h1, h2 ∈ S, p(h1) 6= p(h2)⇒ p′(h1) 6= p′(h2).
(In practice, condition 1 may be relaxed to separating at least one of the [...] A-state q ∈ QR,p with an L-state q2, after q has already been associated with an L-state q1 6= q2. As A is minimal, q1 and q2 cannot be equivalent. It follows that if w1, w2 ∈ Σ∗ are the BFS traversal paths [...] associated with q1, q2 ∈ QA, then there exists some differentiating sequence s ∈ Σ∗ for which fA(q1, s) 6= fA(q2, s), i.e., for which fA(w1·s) 6= fA(w2·s). Con- versely, the arrival of w1 and w2 at the same A-state …