Object-Oriented Data via Prefix Rewriting. Part II: Effective Analysis of Rewriting
Alexander E. Gutman · Siberian Mathematical Journal · 2026
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.