For an arbitrary prefix rewriting system, algorithms are described for recognizing recurrent words and verifying their existence, a new finite recurrence basis is proposed, and conditions for the existence of weakly recurrent words are obtained, together with a relation between such words and infinite chains of weak rewriting.

Keywords:prefix rewriting, term rewriting, information system, object-oriented data.