Bottom-up tree pushdown automata: Classification and connection with rewrite systems
type: Item
instance of: scholarly article
title: Bottom-up tree pushdown automata: Classification and connection with rewrite systems
zbMATH Open document ID: 0805.68083
DOI: 10.1016/0304-3975(94)90101-5
author: Jean-Luc Coquidé
author: Max Dauchet
author: Rémi Gilleron
author: Sándor Vágvölgyi
published in: Theoretical Computer Science
publication date: 1994-05-15T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 567717
zbMATH Keywords: bottom-up tree pushdown automata
zbMATH Keywords: rewrite systems
zbMATH Keywords: decidability
zbMATH Keywords: ground reducibility
zbMATH Keywords: recognizability
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90101-5
OpenAlex ID: W1974542856
cites work: Thue systems as rewriting systems
cites work: Tree generating regular systems
cites work: Bottom-up tree pushdown automata and rewrite systems
cites work: Q3974858
cites work: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
cites work: Q4385532
cites work: Bottom-up and top-down tree transformations— a comparison
cites work: Q3485880
cites work: Reductions in tree replacement systems
cites work: Q4179852
cites work: Q4035665
cites work: Pushdown tree automata
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
cites work: Semantic confluence tests and completion methods
cites work: Deterministic tree pushdown automata and monadic tree rewriting systems
cites work: Tree pushdown automata
description: scientific article; zbMATH DE number 567717