Recognizable Series on Hypergraphs
Formal Languages and Automata Theory
2014-10-17 v2 Combinatorics
Abstract
We introduce the notion of Hypergraph Weighted Model (HWM) that generically associates a tensor network to a hypergraph and then computes a value by tensor contractions directed by its hyperedges. A series r defined on a hypergraph family is said to be recognizable if there exists a HWM that computes it. This model generalizes the notion of rational series on strings and trees. We prove some properties of the model and study at which conditions finite support series are recognizable.
Keywords
Cite
@article{arxiv.1404.7533,
title = {Recognizable Series on Hypergraphs},
author = {Raphaël Bailly and François Denis and Guillaume Rabusseau},
journal= {arXiv preprint arXiv:1404.7533},
year = {2014}
}