Recognizable series on graphs and hypergraphs
From MaRDI portal
Publication:2424675
DOI10.1016/j.jcss.2017.09.008zbMath1423.68162OpenAlexW2767121203MaRDI QIDQ2424675
Guillaume Rabusseau, François Denis, Raphaël Bailly
Publication date: 25 June 2019
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2017.09.008
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- A spectral algorithm for learning hidden Markov models
- Spectral learning of weighted automata. A forward-backward perspective
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- The density-matrix renormalization group in the age of matrix product states
- Handbook of weighted automata
- Recognizable formal power series on trees
- Some properties of two-dimensional on-line tessellation acceptors
- Recognizable picture languages and domino tiling
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Queries and concept learning
- Weighted picture automata and weighted logics
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic
- Binary hidden Markov models and varieties
- Finite Automata over Structures
- Connection Matrices and the Definability of Graph Parameters
- Weighted Automata and Logics on Graphs
- Tensor Spaces and Numerical Tensor Calculus
- On the definition of a family of automata
- Learning Rational Stochastic Tree Languages
- Handbook of Graph Grammars and Computing by Graph Transformation
- Learning functions represented as multiplicity automata
- A Spectral Approach for Probabilistic Grammatical Inference on Trees
- Hand-waving and interpretive dance: an introductory course on tensor networks
- Language identification in the limit
This page was built for publication: Recognizable series on graphs and hypergraphs