Skip to search formSkip to main contentSkip to account menu

Tree homomorphism

In computer science, a tree homomorphism is a type of homomorphism defined on trees.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Unlike the existing certified structures such as Jump List and Markel Tree, we design a single documented structure known as the… 
2018
2018
There is a well-known correspondence due to Goursat between subgroups of a direct product of groups, A×B, and triples of the form… 
2015
2015
For any abelian variety $A$ over a number field, we construct an extension of the Tate-Shafarevich group by the Bloch-Tamagawa… 
2014
2014
An intuitionistic fuzzy finite automaton with an unique membership transition on an input symbol IFA-UM is considered. IFA-UM… 
2012
2012
We extend ${\mathcal H}_1$-clauses with disequalities between images of terms under a tree homomorphism (hom-disequalities). This… 
2009
2009
Functional dependencies form an important class of integrity constraints which has been well studied in the context of relational… 
2001
2001
These notes begin with a quick refresher of a whole slew of elementary graph theory topics. Definitions and theorems abound but… 
1996
1996
During the execution of functional logic programs, E-unification problems have to be solved quite frequently, where the… 
1970
1970
We study this and associated theorems in the context of a logmodular function algebra and, in particular, in the Banach algebra…