For an arbitrary deterministic longest-prefix rewriting system, a criterion is obtained for the infinite rewritability of a word, on the basis of which an effective procedure is developed for analyzing the rewriting sequence.

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