Vágvölgyi Sándor: One-pass reductions. In: Acta cybernetica, (22) 3. pp. 633-655. (2016)
Preview |
Cikk, tanulmány, mű
actacyb_22_3_2016_6.pdf Download (369kB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 2016 |
| Volume: | 22 |
| Number: | 3 |
| ISSN: | 0324-721X |
| Page Range: | pp. 633-655 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/41665/ |
| DOI: | 10.14232/actacyb.22.3.2016.6 |
| Uncontrolled Keywords: | Programozás |
| Additional Information: | Bibliogr.: p. 653-655. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2017. Mar. 16. 13:37 |
| Last Modified: | 2022. Jun. 20. 13:43 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/40267 |
Actions (login required)
 |
View Item |
