Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
type: Item
instance of: scholarly article
title: Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
zbMATH Open document ID: 1184.68302
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5664468
zbMATH Keywords: monadic term rewrite system
zbMATH Keywords: tree automaton
zbMATH Keywords: descendant of a tree language
zbMATH Keywords: formal languages
author: Sándor Vágvölgyi
describes a project that uses: Timbuk
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.03.008
OpenAlex ID: W2085600536
cites work: Bottom-up tree pushdown automata: Classification and connection with rewrite systems
cites work: Reachability analysis over term rewriting systems
cites work: Q2723425
cites work: Reachability Analysis of Term Rewriting Systems with Timbuk
cites work: Q4847003
cites work: Linear generalized semi-monadic rewrite systems effectively preserve recognizability
cites work: Some undecidability results concerning the property of preserving regularity
cites work: Tree automata for rewrite strategies
cites work: Deterministic tree pushdown automata and monadic tree rewriting systems
cites work: Q2723905
DOI: 10.1016/J.IPL.2006.03.008
description: scientific article; zbMATH DE number 5664468