www-ai.cs.tu-dortmund.de/en/LEHRE/SEMINARE/WS2122/TrustworthyAIMachineLearning/weiss2018a.pdf
over the alphabet {0, 1}: [1] 1∗, [2] (10)∗, [3] the complement of ((0|1)∗0)∗1(11)∗(0(0|1)∗1)∗0(00)∗(1(0|1)∗)∗, [4] all words w not containing 000, [5] all w for which #0(w) and #1(w) are even (where #a(w) [...] and 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 [...] on BP.
Refinement Based Brute Force example Time (s) example Time (s) )) 1.1 )) 0.4 (()) 1.2 (()i)ma 32.6 ((())) 2.1 (((()))) 3.1 ((((())))) 3.8 (((((()))))) 4.4 ((((((())))))) 6.6 (((((((()))))))) 9.2 …
