A new family of Markov branching trees: the alpha-gamma model.
Chen, Bo, Ford, Daniel, Winkel, Matthias (2009)
Electronic Journal of Probability [electronic only]
Similarity:
Chen, Bo, Ford, Daniel, Winkel, Matthias (2009)
Electronic Journal of Probability [electronic only]
Similarity:
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).
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...
Iriarte Giraldo, Benjamin (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...
Gutman, I., Pavlović, Ljiljana (2003)
Bulletin. Classe des Sciences Mathématiques et Naturelles. Sciences Mathématiques
Similarity:
Miermont, Grégory, Weill, Mathilde (2008)
Electronic Journal of Probability [electronic only]
Similarity: