Decidability for left-linear growing term rewriting systems.
type: Item
instance of: scholarly article
title: Decidability for left-linear growing term rewriting systems.
zbMATH Open document ID: 1049.68075
author: Takashi Nagaya
author: Yoshihito Toyama
published in: Information and Computation
publication date: 2002-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1964176
zbMATH Keywords: reachabiilty
zbMATH Keywords: sequentiality
zbMATH Keywords: joinability
MaRDI profile type: Publication
OpenAlex ID: W642373709
cites work: Term Rewriting and All That
cites work: Sequentiality, monadic second-order logic and tree automata.
cites work: Bottom-up tree pushdown automata: Classification and connection with rewrite systems
cites work: Q3917482
cites work: Decidable call-by-need computations in term rewriting
cites work: Q3323279
cites work: Q4847003
cites work: Linear generalized semi-monadic rewrite systems effectively preserve recognizability
cites work: Q4846997
cites work: Q4705608
cites work: NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
cites work: Deterministic tree pushdown automata and monadic tree rewriting systems
cites work: Q2723905
DOI: 10.1006/INCO.2002.3157
description: scientific article; zbMATH DE number 1964176