Recognizable tree-languages and nonlinear morphisms
type: Item
instance of: scholarly article
title: Recognizable tree-languages and nonlinear morphisms
zbMATH Open document ID: 1014.68092
DOI: 10.1016/S0304-3975(02)00014-2
author: Max Dauchet
author: Sophie Tison
author: M. Tommasi
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1767894
zbMATH Keywords: tree morphisms
zbMATH Keywords: quasi-alphabetic homomorphism
zbMATH Keywords: cross-section theorem
MaRDI profile type: Publication
cites work: Morphismes et bimorphismes d'arbres
cites work: Q4260705
cites work: Equality and disequality constraints on direct subterms in tree automata
cites work: Pumping, cleaning and symbolic constraints solving
cites work: Encompassment properties and automata with constraints
cites work: Q4038726
cites work: Bottom-up and top-down tree transformations— a comparison
cites work: Q3323279
cites work: Linearizing term rewriting systems using test sets
cites work: On relationship between term rewriting systems and regular tree languages
cites work: Decidability of regularity and related properties of ground normal form languages
cites work: Q3836513
cites work: Rational bijection of rational sets
cites work: Transductions des langages de Chomsky
cites work: Q4431392
full work available at URL: s0304-3975(02)00014-2
OpenAlex ID: W2049463663
description: scientific article; zbMATH DE number 1767894