2006/02/27 by François Denis, Denis, François, Yann Esposito +1 · 2 citations
Computer Science · #Computability, Logic, AI Algorithms #Computation and Language (cs.CL) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning and Algorithms #cs.CL #cs.LG #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.cs/0602093
35 pages
arxiv created 2006/02/27 · openalex publication_date 2006/02/27 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The goal of the present paper is to provide a systematic and comprehensive study of rational stochastic languages over a semiring K ∈ Q, Q +, R, R+. A rational stochastic language is a probability distribution over a free monoid Σ^* which is rational over K, that is which can be generated by a multiplicity automata with parameters in K. We study the relations between the classes of rational stochastic languages S rat K (Σ). We define the notion of residual of a stochastic language and we use it to investigate properties of several subclasses of rational stochastic languages. Lastly, we study the representation of rational stochastic languages by means of multiplicity automata.