A Canonical Form for Weighted Automata and Applications to Approximate Minimization

DOI10.1109/LICS.2015.70zbMath1401.68145arXiv1501.06841MaRDI QIDQ4635848

Doina Precup, Borja Balle, Prakash Panangaden

Publication date: 23 April 2018

Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Learning infinite-word automata with loop-index queries ⋮ Singular value automata and approximate minimization ⋮ Unnamed Item ⋮ Quantum theory in finite dimension cannot explain every general process with finite memory ⋮ Generalization bounds for learning weighted automata ⋮ Unnamed Item ⋮ On the metric-based approximate minimization of Markov chains ⋮ Bisimulation metrics and norms for real-weighted automata ⋮ Approximate minimization of weighted tree automata ⋮ On the Rademacher Complexity of Weighted Automata

This page was built for publication: A Canonical Form for Weighted Automata and Applications to Approximate Minimization