Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Recognizable Series on Hypergraphs
verfasst von : Raphaël Bailly, François Denis, Guillaume Rabusseau
Erschienen in: Language and Automata Theory and Applications
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 recognizable series on strings and trees. We present some properties of the model and study at which conditions finite support series are recognizable.