Algorithms to test open set condition for self-similar set related to P.V. numbers

Fix a P.V. number λ−1>1λ−1>1. Given p=(p1,⋯,pm)∈Nmp=(p1,⋯,pm)∈Nm, b=(b1,⋯,bm)∈Qmb=(b1,⋯,bm)∈Qm, for the self-similar set Ep,b=⋃i=1m(λpiEp,b+bi) we find an efficient algorithm to test whether Ep,bEp,b satisfies the open set condition (strong separation condition) or not.