Recognizable series on hypergraphs

DOI10.1007/978-3-319-15579-1_50MaRDI QIDQ2799214zbMATH OpenOpenAlexFDO

Authors Raphaël Bailly, François Denis, Guillaume Rabusseau

Publication date 8 April 2016

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.7533

Mathematics Subject Classification ID

Hypergraphs (05C65) Multilinear algebra, tensor calculus (15A69)

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.

Recommendations

• Recognizable series on graphs and hypergraphs
• A Medvedev characterization of recognizable tree series
• Developments in Language Theory
• Recognizability, hypergraph operations, and logical types
• Hyperforests on the complete hypergraph by Grassmann integral representation

Cited in

(1)

• Recognizable series on graphs and hypergraphs

This page was built for publication: Recognizable series on hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799214)