Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,085,990 papers from all fields of science
Search
Sign In
Create Free Account
Tree (set theory)
Known as:
Tree (disambiguation)
, Tree (set theoretic)
In set theory, a tree is a partially ordered set (T, <) such that for each t ∈ T, the set {s ∈ T : s < t} is well-ordered by the relation <…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Aronszajn tree
Cantor tree
Descendant tree (group theory)
Graph theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in FL_0
F. Baader
,
O. Gil
,
Pavlos Marantidis
Language and Automata Theory and Applications
2017
Corpus ID: 11921208
Recently introduced approaches for relaxed query answering, approximately defining concepts, and approximately solving…
Expand
2015
2015
Electrical tree characteristics of XLPE under repetitive pulse voltage in low temperature
B. Du
,
L. W. Zhu
IEEE transactions on dielectrics and electrical…
2015
Corpus ID: 21816779
Cross-linked polyethylene (XLPE) may be operated under repetitive pulse voltage and low temperature environment. In recent years…
Expand
2014
2014
Rhythmic generation of infinite trees and languages
Victor Marsault
,
J. Sakarovitch
arXiv.org
2014
Corpus ID: 15129690
This work builds on the notion of breadth-first signature of infinite trees and (prefix-closed) languages introduced by the…
Expand
2009
2009
Towards a Parallel Search for Solutions of Non-deterministic Computations
Fabian Reck
,
Sebastian Fischer
GI Jahrestagung
2009
Corpus ID: 18618102
In this paper we explore the possibilities to perform the search for results of non-deterministic computations in parallel. We…
Expand
2007
2007
Uniformly continuous maps between ends of R-trees
Álvaro Martinez Pérez
,
Manuel A. Morón
2007
Corpus ID: 115158363
There is a well-known correspondence between infinite trees and ultrametric spaces which can be interpreted as an equivalence of…
Expand
Review
2007
Review
2007
USING FEATURE LOGIC PROGRAMMING TO DESCRIBE TREE TRANSDUCERS AND TREE ADJOINING GRAMMARS
I. Ntroduction
2007
Corpus ID: 38412426
This draft paper contains a new proposal for modeling tree transductions and tree adjoining grammars using feature logic…
Expand
2005
2005
Querying Tree-Structured Data Using Dimension Graphs
D. Theodoratos
,
Theodore Dalamagas
International Conference on Advanced Information…
2005
Corpus ID: 8228496
Tree structures provide a popular means to organize the information on the Web. Taxonomies of thematic categories, concept…
Expand
1991
1991
Fixed Point Characterization of Büchi Automata on Infinite Trees
A. Arnold
,
D. Niwinski
Journal of Information Processing and Cybernetics
1991
Corpus ID: 23597500
1984
1984
Decidability of yield's equality for infinite regular trees
M. Dauchet
,
E. Timmerman
Automata on Infinite Words
1984
Corpus ID: 12897493
We introduce yield of infinite trees. Trees are provided with usual syntactic order, words with a new order that canonically…
Expand
1984
1984
Yields of Infinite Trees
E. Timmermann
Colloquium on Trees in Algebra and Programming
1984
Corpus ID: 5243190
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