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 |
| LEADER | 01718nab a2200253 i 4500 | ||
|---|---|---|---|
| 001 | acta12611 | ||
| 005 | 20220614083813.0 | ||
| 008 | 161015s1999 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Fülöp Zoltán | |
| 245 | 1 | 3 | |a On one-pass term rewriting |h [elektronikus dokumentum] / |c Fülöp Zoltán |
| 260 | |c 1999 | ||
| 300 | |a 83-98 | ||
| 490 | 0 | |a Acta cybernetica |v 14 No. 1 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 700 | 0 | 1 | |a Jurvanen Eija |e aut |
| 700 | 0 | 1 | |a Steinby Magnus |e aut |
| 700 | 0 | 1 | |a Vágvölgyi Sándor |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12611/1/cybernetica_014_numb_001_083-098.pdf |z Dokumentum-elérés |