On one-pass term rewriting
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. O...
Elmentve itt :
Szerzők: | |
---|---|
Dokumentumtípus: | Cikk |
Megjelent: |
1999
|
Sorozat: | Acta cybernetica
14 No. 1 |
Kulcsszavak: | Számítástechnika, Kibernetika |
Tárgyszavak: | |
Online Access: | http://acta.bibl.u-szeged.hu/12611 |
Tartalmi kivonat: | 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. |
---|---|
Terjedelem/Fizikai jellemzők: | 83-98 |
ISSN: | 0324-721X |