Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,143,946 papers from all fields of science
Search
Sign In
Create Free Account
Tree homomorphism
In computer science, a tree homomorphism is a type of homomorphism defined on trees.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Computer science
Tree (data structure)
Tree automaton
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
A NOVEL CAPABLE OUTLYING DATA CONTROL CHECKING PROCEDURE IN CLOUD STORAGE
A. Jyothsna
,
C. Siva
2019
Corpus ID: 199013143
Unlike the existing certified structures such as Jump List and Markel Tree, we design a single documented structure known as the…
Expand
2018
2018
Constructing subgroups of semidirect products via generalized derivations
Jill Dietz
,
A. Giannini
,
Akina Khan
,
Michael W. Schroeder
,
S. Olaf
2018
Corpus ID: 51883742
There is a well-known correspondence due to Goursat between subgroups of a direct product of groups, A×B, and triples of the form…
Expand
2015
2015
A note on the Bloch-Tamagawa space and Selmer groups
N. Ramachandran
2015
Corpus ID: 43396295
For any abelian variety $A$ over a number field, we construct an extension of the Tate-Shafarevich group by the Bloch-Tamagawa…
Expand
2014
2014
An Intuitionistic Fuzzy Finite Automaton on Homomorphism and Admissible relation
.K JencyPriya
,
Telesphor Lakra
,
J. Jordona
,
T. Rajaretnam
2014
Corpus ID: 11461900
An intuitionistic fuzzy finite automaton with an unique membership transition on an input symbol IFA-UM is considered. IFA-UM…
Expand
2012
2012
Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses
Andreas Reuß
,
H. Seidl
International Conference on Implementation and…
2012
Corpus ID: 41359460
We extend ${\mathcal H}_1$-clauses with disequalities between images of terms under a tree homomorphism (hom-disequalities). This…
Expand
2009
2009
XML Functional Dependencies Based on Tree Homomorphisms
D. Trinh
2009
Corpus ID: 45109186
Functional dependencies form an important class of integrity constraints which has been well studied in the context of relational…
Expand
2001
2001
Graph Theoretic Methods in Computer Vision
M. Holly
2001
Corpus ID: 59862418
These notes begin with a quick refresher of a whole slew of elementary graph theory topics. Definitions and theorems abound but…
Expand
1996
1996
A Strict Border for the Decidability of E-Unification for Recursive Functions
H. Faßbender
,
S. Maneth
Journal of Functional and Logic Programming
1996
Corpus ID: 1759252
During the execution of functional logic programs, E-unification problems have to be solved quite frequently, where the…
Expand
1970
1970
A Function Algebra Approach to a Theorem of Lindelöf
M. Rosenfeld
,
Max L. Weiss
1970
Corpus ID: 14789539
We study this and associated theorems in the context of a logmodular function algebra and, in particular, in the Banach algebra…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE