Absolute convergence of rational series is semi-decidable

DOI10.1016/j.ic.2010.11.004zbMath1221.68113OpenAlexW2713277125MaRDI QIDQ553292

Raphaël Bailly, François Denis

Publication date: 27 July 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2010.11.004

zbMATH Keywords

absolute convergenceweighted automatarational seriesreal-valued formal power series

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (2)

Generalization bounds for learning weighted automata ⋮ On the Rademacher Complexity of Weighted Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sets of matrices all infinite products of which converge
• Bounded semigroups of matrices
• On the accuracy of the ellipsoid norm approximation of the joint spectral radius
• The consensus string problem and the complexity of comparing hidden Markov models.
• L_p DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
• Learning Rational Stochastic Languages
• On the Computation of Some Standard Distances Between Probabilistic Automata

This page was built for publication: Absolute convergence of rational series is semi-decidable