A property of left-linear rewrite systems preserving recognizability
type: Item
instance of: scholarly article
title: A property of left-linear rewrite systems preserving recognizability
zbMATH Open document ID: 0944.68082
DOI: 10.1016/S0304-3975(00)00039-6
author: Pál Gyenizse
author: Sándor Vágvölgyi
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1493369
zbMATH Keywords: rewrite systems
zbMATH Keywords: sets of descendants
zbMATH Keywords: tree automata
zbMATH Keywords: recognizability preserving
MaRDI profile type: Publication
cites work: Tree generating regular systems
cites work: Bottom-up tree pushdown automata: Classification and connection with rewrite systems
cites work: Q4385532
cites work: Reductions in tree replacement systems
cites work: Q3323279
cites work: Q4179852
cites work: Q4035665
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: Deterministic tree pushdown automata and monadic tree rewriting systems
Recommended article: Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Recommended article: Q3559957
Recommended article: Q2723905
Recommended article: Generalizing Newman’s Lemma for Left-Linear Rewrite Systems
Recommended article: Q4808741
Recommended article: On the property of preserving regularity for string-rewriting systems
Recommended article: Q4938609
Recommended article: Decidability for left-linear growing term rewriting systems.
Recommended article: Existence, Uniqueness, and Construction of Rewrite Systems
Recommended article: Strictly orthogonal left linear rewrite systems and primitive recursion
description: scientific article; zbMATH DE number 1493369