Abstract The computationally hard problem of finite language decomposition is investigated. A L decomposable if there are two languages 1 and 2 such that = . Otherwise, prime. main contribution the paper an adaptive parallel algorithm for finding all decompositions based on exhaustive search incorporates several original methods pruning space. Moreover, since it changes its behavior runtime acq...