Free Term Algebras

Grzegorz Bancerek

Displaying similar documents to “Free Term Algebras”

Constructing Binary Huffman Tree

Hiroyuki Okazaki, Yuichi Futa, Yasunari Shidama (2013)

Formalized Mathematics

Similarity:

Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm. In this article we formalize an algorithm constructing a binary code tree, Huffman tree.

Operads and algebraic combinatorics of trees.

Chapoton, Frédéric (2007)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

The combinatorics of evolutionary trees---a survey.

Székely, Laszlo A., Erdős, Péter L., Steel, M.A. (1992)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

A note on naturally embedded ternary trees.

Kuba, Markus (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Dissimilarity vectors of trees are contained in the tropical Grassmannian.

Iriarte Giraldo, Benjamin (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The product of trees in the Loday-Ronco algebra through Catalan alternative tableaux.

Aval, Jean-Christophe, Viennot, Xavier (2010)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

Automorphisms of the Planar Tree Power Series Algebra and the Non-Associative Logarithm

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).

Weak Completeness Theorem for Propositional Linear Time Temporal Logic

Mariusz Giero (2012)

Formalized Mathematics

Similarity:

We prove weak (finite set of premises) completeness theorem for extended propositional linear time temporal logic with irreflexive version of until-operator. We base it on the proof of completeness for basic propositional linear time temporal logic given in [20] which roughly follows the idea of the Henkin-Hasenjaeger method for classical logic. We show that a temporal model exists for every formula which negation is not derivable (Satisfiability Theorem). The contrapositive of that...

Tree compression pushdown automaton

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 $n$ nodes, the automaton has at most $n + 1$ states, its transition function cardinality is at most $4 n$ and there are $2 n + 1$ pushdown store symbols. If hashing is used...