Derivation trees of ground term rewriting systems.
type: Item
instance of: scholarly article
title: Derivation trees of ground term rewriting systems.
zbMATH Open document ID: 1045.68580
author: Joost Engelfriet
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 20M05
zbMATH DE Number: 1853050
MaRDI profile type: Publication
full work available at URL: inco.1998.2786
OpenAlex ID: W1980623818
cites work: Tree generating regular systems
cites work: Regular canonical systems
cites work: Bottom-up tree pushdown automata: Classification and connection with rewrite systems
cites work: Q3979263
cites work: Q3702507
cites work: Q3917482
cites work: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
cites work: Prefix grammars: An alternative characterization of the regular languages
cites work: Q3468622
cites work: Q3323279
cites work: Q4179852
cites work: A Note on Pushdown Store Automata and Regular Systems
cites work: Q4198075
cites work: Decidable approximations of term rewriting systems
cites work: The Church-Rosser property for ground term-rewriting systems is decidable
cites work: Q3680279
cites work: A fast algorithm for constructing a tree automaton recognizing a congruential tree language
DOI: 10.1006/INCO.1998.2786
description: scientific article; zbMATH DE number 1853050