One-pass reductions

We study OI and IO one-pass reduction sequences with term rewrite systems. We present second order decidability and undecidability results on recognizable tree languages and one-pass reductions. For left-linear TRSs, the second order OI inclusion problem and the second order OI reachability problem...

Full description

Saved in:
Bibliographic Details
Main Author: Vágvölgyi Sándor
Format: Article
Published: 2016
Series:Acta cybernetica 22 No. 3
Kulcsszavak:Programozás
Subjects:
doi:10.14232/actacyb.22.3.2016.6

Online Access:http://acta.bibl.u-szeged.hu/40267
Description
Summary:We study OI and IO one-pass reduction sequences with term rewrite systems. We present second order decidability and undecidability results on recognizable tree languages and one-pass reductions. For left-linear TRSs, the second order OI inclusion problem and the second order OI reachability problem are decidable, the second order OI joinability problem is undecidable. For right-linear TRSs, the second order common IO ancestor problem is undecidable.
Physical Description:633-655
ISSN:0324-721X