Learning Rational Stochastic Languages

DOI10.1007/11776420_22zbMath1143.68414arXivcs/0602062OpenAlexW1778096727MaRDI QIDQ5307574

Yann Esposito, Amaury Habrard, François Denis

Publication date: 14 September 2007

Published in: Learning Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (5)

Good edit similarity learning by loss minimization ⋮ Learning Rational Stochastic Tree Languages ⋮ \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition ⋮ Absolute convergence of rational series is semi-decidable ⋮ Absolute Convergence of Rational Series Is Semi-decidable

This page was built for publication: Learning Rational Stochastic Languages