Tree homomorphism
In computer science, a tree homomorphism is a type of homomorphism defined on trees.
Definition
Given a pair of rooted node-labeled trees and , a mapping from the nodes of to the nodes of is a tree homomorphism if the following conditions hold:
- maps the root of to the root of ,
- if node is a child of node in , then is a child of in , and
- for every node , the label of in is the same as the label of in .
gollark: Yes, since you don't apparently know the relevant maths either.
gollark: This is because, unlike physics and such, it is not really testable.
gollark: Philosophers are obsolete, as we can just procedurally generate philosophy on-demand.
gollark: That is *so* many monoids.
gollark: Idea: replace philosophers with GPT-3.
See also
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.