Trees in the Real Field

2018/07/11 by Betti, Alessandro, Gori, Marco
#Discrete Mathematics (cs.DM) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1807.06440

Abstract

This paper proposes an algebraic view of trees which opens the doors to an alternative computational scheme with respect to classic algorithms. In particular, it is shown that this view is very well-suited for machine learning and computational linguistics.

Related

• Real trees in topology, geometry, and group theory
• Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic
• Some connections between universal algebra and logics for trees
• How to encode a tree
• Tree Automata and Tree Grammars