An algorithmic approach to the problem of a semiretract base

A semiretract of a free monoid A* is an intersection of a family of retracts of A* and it is a free submonoid. In the paper we propose an algorithmic approach to the problem of finding the base (code) of a semiretract.