On one-pass term rewriting

Fülöp Zoltán and Jurvanen Eija and Steinby Magnus and Vágvölgyi Sándor: On one-pass term rewriting. In: Acta cybernetica, (14) 1. pp. 83-98. (1999)

[thumbnail of cybernetica_014_numb_001_083-098.pdf]
Cikk, tanulmány, mű

Download (950kB) | Preview


Two restricted ways to apply a term rewriting system (TRS) to a tree are considered. When the one-pass root-started, strategy is followed, rewriting starts from the root and continues stepwise towards the leaves without ever rewriting a paxt of the current tree produced in a previous rewrite step. Onepass leaf-started, rewriting is defined similarly, but rewriting begins from the leaves. In the sentential form inclusion problem one asks whether all trees which can be obtained with a given TRS from the trees of some regular tree language T belong to another given regular tree language U, and in the normal form inclusion problem the same question is asked about the normal forms of T. We show that for a left-linear TRS these problems can be decided for both of our one-pass strategies. In all four cases the decision algorithm involves the construction of a suitable tree recognizer.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1999
Volume: 14
Number: 1
ISSN: 0324-721X
Page Range: pp. 83-98
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38507/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 97-98. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:26
Last Modified: 2022. Jun. 14. 08:38
URI: http://acta.bibl.u-szeged.hu/id/eprint/12611

Actions (login required)

View Item View Item