Approximate minimization of weighted tree automata
From MaRDI portal
Publication:2064525
DOI10.1016/j.ic.2020.104654zbMath1485.68133OpenAlexW3099260962MaRDI QIDQ2064525
Guillaume Rabusseau, Borja Balle
Publication date: 6 January 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2020.104654
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- A spectral algorithm for learning hidden Markov models
- Spectral learning of weighted automata. A forward-backward perspective
- The rank of a formal tree power series
- Learning regular sets from queries and counterexamples
- Recognizable formal power series on trees
- Matrices de Hankel
- Inversion error, condition number, and approximate inverses of uncertain matrices
- Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes
- On the learnability of discrete distributions
- Tensor decompositions for learning latent variable models
- Learning Weighted Automata
- Minimisation of Multiplicity Tree Automata
- Newtonian program analysis
- A theory of the learnable
- Weighted Languages Recognizable by Weighted Tree Automata
- A Canonical Form for Weighted Automata and Applications to Approximate Minimization
- A Spectral Approach for Probabilistic Grammatical Inference on Trees
- Weighted Tree Automata and Tree Transducers
- THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES
- Theoretical Foundations of Functional Data Analysis, with an Introduction to Linear Operators
- Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars
This page was built for publication: Approximate minimization of weighted tree automata
