Tree homomorphism

Tree homomorphism

In computer science, a tree homomorphism is a type of homomorphism defined on trees.

Definition

Given a pair of node-labeled trees T_1 and T_2, a mapping phi from the nodes of T_1 to the nodes of T_2 is a "tree homomorphism" if the following conditions hold:

* phi maps the root of T_1 to the root of T_2,
* if node n_2 is a child of node n_1 in T_1, then phi(n_2) is a child of phi(n_1) in T_2, and
* for every node n in T_1, the label of n in T_1 is the same as the label of phi(n) in T_2.

See also

* Homomorphism


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… …   Wikipedia

  • Butcher group — In mathematics, the Butcher group, named after the New Zealand mathematician John C. Butcher by Hairer Wanner (1974), is an infinite dimensional group first introduced in numerical analysis to study solutions of non linear ordinary differential… …   Wikipedia

  • Catamorphism — The concept of a catamorphism is grounded in category theory, and has been applied to functional programming. It denotes the unique homomorphism for an initial algebra. The term comes from Greek Polytonic|κατα (downwards, according to) + morphism …   Wikipedia

  • Bass–Serre theory — is a part of the mathematical subject of group theory that deals with analyzing the algebraic structure of groups acting by automorphisms on simplicial trees. The theory relates group actions on trees with decomposing groups as iterated… …   Wikipedia

  • Monoid — This article is about the mathematical concept. For the alien creatures in the Doctor Who adventure, see The Ark (Doctor Who). Coherence law for monoid unit In abstract algebra, a branch of mathematics, a monoid is an algebraic structure with a… …   Wikipedia

  • Semilattice — In mathematics, a join semilattice (or upper semilattice) is a partially ordered set which has a join (a least upper bound) for any nonempty finite subset. Dually, a meet semilattice (or lower semilattice) is a partially ordered set which has a… …   Wikipedia

  • Fundamental group — In mathematics, the fundamental group is one of the basic concepts of algebraic topology. Associated with every point of a topological space there is a fundamental group that conveys information about the 1 dimensional structure of the portion of …   Wikipedia

  • Free group — In mathematics, a group G is called free if there is a subset S of G such that any element of G can be written in one and only one way as a product of finitely many elements of S and their inverses (disregarding trivial variations such as st 1 =… …   Wikipedia

  • Braid group — In mathematics, the braid group on n strands, denoted by B n , is a certain group which has an intuitive geometrical representation, and in a sense generalizes the symmetric group S n . Here, n is a natural number; if n gt; 1, then B n is an… …   Wikipedia

  • List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”