On ground tree transformations and congruences induced by tree automata.
type: Item
instance of: scholarly article
title: On ground tree transformations and congruences induced by tree automata.
zbMATH Open document ID: 1046.68067
DOI: 10.1016/S0304-3975(03)00279-2
author: Sándor Vágvölgyi
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1965410
zbMATH Keywords: Tree automata
zbMATH Keywords: Ground tree transducers
zbMATH Keywords: Ground term rewrite systems
MaRDI profile type: Publication
cites work: Tree generating regular systems
cites work: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
cites work: Derivation trees of ground term rewriting systems.
cites work: Q4005178
cites work: Minimal equational representations of recognizable tree languages
cites work: Restricted ground tree transducers
cites work: Q3323279
cites work: Shostak's congruence closure as completion
cites work: Q4764112
cites work: The Church-Rosser property for ground term-rewriting systems is decidable
cites work: Proof lengths for equational completion
cites work: A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
cites work: A fast algorithm for constructing a tree automaton recognizing a congruential tree language
cites work: Congruential complements of ground term rewrite systems
full work available at URL: s0304-3975(03)00279-2
OpenAlex ID: W2065699939
description: scientific article; zbMATH DE number 1965410