Absolute Convergence of Rational Series Is Semi-decidable

DOI10.1007/978-3-642-00982-2_10zbMath1234.68194OpenAlexW1506714864MaRDI QIDQ3618573

Raphaël Bailly, François Denis

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Absolute Convergence of Rational Series Is Semi-decidable