Deterministic bottom-up tree transducers and ground term rewrite systems
type: Item
instance of: scholarly article
title: Deterministic bottom-up tree transducers and ground term rewrite systems
zbMATH Open document ID: 1171.68018
author: Sándor Vágvölgyi
published in: Theoretical Computer Science
publication date: 2009-05-28T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5559006
zbMATH Keywords: bottom-up tree transducer
zbMATH Keywords: bottom-up tree automaton
zbMATH Keywords: ground term rewrite system
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.02.040
OpenAlex ID: W2009459103
cites work: Abstract regular tree model checking
cites work: Q3906457
cites work: Minimal equational representations of recognizable tree languages
cites work: Q4179852
cites work: A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
cites work: Congruential complements of ground term rewrite systems
cites work: Term rewriting restricted to ground terms.
cites work: Q4185831
DOI: 10.1016/J.TCS.2009.02.040
Recommended article: Bottom-up tree pushdown automata and rewrite systems
Recommended article: Deterministic tree pushdown automata and monadic tree rewriting systems
Recommended article: Deterministic top-down tree transducers with iterated look-ahead
Recommended article: Q4995361
Recommended article: Synthesis of deterministic top-down tree transducers from automatic tree relations
Recommended article: Minimization of Deterministic Bottom-Up Tree Transducers
Recommended article: Linear deterministic multi bottom-up tree transducers
Recommended article: Definability results for top-down tree transducers
Recommended article: Definability Results for Top-Down Tree Transducers
Recommended article: Bottom-up tree pushdown automata: Classification and connection with rewrite systems
description: scientific article; zbMATH DE number 5559006