Right-linear half-monadic term rewrite systems
type: Item
instance of: scholarly article
title: Right-linear half-monadic term rewrite systems
zbMATH Open document ID: 1070.68058
DOI: 10.1016/S0304-3975(03)00239-1
published in: Theoretical Computer Science
publication date: 2004-10-27T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 2110995
zbMATH Keywords: Term rewrite systems
zbMATH Keywords: Termination
zbMATH Keywords: Convergence
zbMATH Keywords: Preservation of recognizability
author: Sándor Vágvölgyi
MaRDI profile type: Publication
cites work: Termination of term rewriting using dependency pairs
cites work: Bottom-up tree pushdown automata: Classification and connection with rewrite systems
cites work: Q3917482
cites work: Q4385532
cites work: Proving termination with multiset orderings
cites work: Q3323279
cites work: Q4714446
cites work: Linear generalized semi-monadic rewrite systems effectively preserve recognizability
cites work: Q4705617
cites work: Q4938609
cites work: Decidability of confluence and termination of monadic term rewriting systems
cites work: Q2723905
cites work: Q4847000
Recommended article: Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Recommended article: Automated Deduction – CADE-20
Recommended article: Modular termination of \(r\)-consistent and left-linear term rewriting systems
Recommended article: Q2723905
Recommended article: Q2778880
Recommended article: Q4376886
Recommended article: Decidability of confluence and termination of monadic term rewriting systems
Recommended article: Foundations of Software Science and Computation Structures
Recommended article: Q3817590
Recommended article: Term Rewriting and Applications
description: scientific article; zbMATH DE number 2110995