Scholarlink

<p>For an&#xa0;arbitrary deterministic longest-prefix rewriting system, a&#xa0;criterion is obtained for the infinite rewritability of a&#xa0;word, on the basis of which an&#xa0;effective procedure is developed for analyzing the rewriting sequence.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Object-Oriented Data via Prefix Rewriting. Part II: Effective Analysis of Rewriting

  • 期刊论文

  • 发表日期：

    2026年7月30日

查看全文
  • A. E. Gutman

摘要

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.