Recognizable series on graphs and hypergraphs

作者：

Highlights：

• We introduce Hypergraph Weighted Models (HWM): a computational model on hypergraphs.

• HWMs generalize recognizable series on strings, trees and pictures.

• Finite support series are not HWM-recognizable in general.

• For HWMs defined on covering-free families, finite support series are recognizable.

• We study a learning problem for HWMs defined on circular strings.

摘要

•We introduce Hypergraph Weighted Models (HWM): a computational model on hypergraphs.•HWMs generalize recognizable series on strings, trees and pictures.•Finite support series are not HWM-recognizable in general.•For HWMs defined on covering-free families, finite support series are recognizable.•We study a learning problem for HWMs defined on circular strings.

论文关键词：Recognizable Series,Graphs,Hypergraphs,Tensor networks

论文评审过程：Received 15 July 2015, Revised 5 August 2017, Accepted 30 September 2017, Available online 20 October 2017, Version of Record 6 June 2019.

论文官网地址：https://doi.org/10.1016/j.jcss.2017.09.008