A note on naturally embedded ternary trees.
Kuba, Markus (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kuba, Markus (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Iriarte Giraldo, Benjamin (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Székely, Laszlo A., Erdős, Péter L., Steel, M.A. (1992)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
T. Miyamoto (1993)
Fundamenta Mathematicae
Similarity:
We show the property “is proper and preserves every -Souslin tree” is preserved by countable support iteration.
Jan Janoušek, Bořivoj Melichar, Martin Poliak (2012)
Kybernetika
Similarity:
A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is presented. The tree compression automaton represents a complete compressed index of a set of trees for subtrees and accepts all subtrees of given trees. The algorithm for constructing our pushdown automaton is incremental. For a single tree with nodes, the automaton has at most states, its transition function cardinality is at most and there are pushdown store symbols. If hashing is used...
Gerritzen, L. (2004)
Serdica Mathematical Journal
Similarity:
2000 Mathematics Subject Classification: 17A50, 05C05. In this note we present the formula for the coefficients of the substitution series f(g(x)) of planar tree power series g(x) into f(x).
Edward W. Odell, Thomas Schlumprecht (2006)
RACSAM
Similarity:
This paper deals with the following types of problems: Assume a Banach space X has some property (P). Can it be embedded into some Banach space Z with a finite dimensional decomposition having property (P), or more generally, having a property related to (P)? Secondly, given a class of Banach spaces, does there exist a Banach space in this class, or in a closely related one, which is universal for this class?
Prodinger, Helmut (1996)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Bořivoj Melichar, Jan Janoušek, Tomas Flouri (2012)
Kybernetika
Similarity:
We present a unified and systematic approach to basic principles of Arbology, a new algorithmic discipline focusing on algorithms on trees. Stringology, a highly developed algorithmic discipline in the area of string processing, can use finite automata as its basic model of computation. For various kinds of linear notations of ranked and unranked ordered trees it holds that subtrees of a tree in a linear notation are substrings of the tree in the linear notation. Arbology uses pushdown...