35 pagesThe 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
The notion of a multistochastic automaton is defined. Several language families are obtained and inv...
Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpo...
L’apprentissage de modèles stochastiques générant des séquences a de nombreuses applications en trai...
International audienceIn probabilistic grammatical inference, a usual goal is to infer a good approx...
Abstract. In probabilistic grammatical inference, a usual goal is to infer a good approximation of a...
International audienceWe consider the problem of learning stochastic tree languages from a sample of...
International audienceRecently, an algorithm, DEES, was proposed for learning rational stochastic tr...
It is shown that a language is recursively enumerable if and only if it is a homomorphic image of a ...
AbstractThe theory of finite automata and coding has been linked to probability theory since its fou...
Some properties of languages representable in finite probabilistic automata are investigated. It is ...
International audienceIt is well known that, under some aperiodicity and irreducibility conditions, ...
The purpose of the paper is to prove that the family of languages accepted by finite probabilistic a...
In this work we study some probabilistic models for the random generation of words over a given alph...
We study the connections between rational series with coefficients in a semiring and their languages...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
The notion of a multistochastic automaton is defined. Several language families are obtained and inv...
Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpo...
L’apprentissage de modèles stochastiques générant des séquences a de nombreuses applications en trai...
International audienceIn probabilistic grammatical inference, a usual goal is to infer a good approx...
Abstract. In probabilistic grammatical inference, a usual goal is to infer a good approximation of a...
International audienceWe consider the problem of learning stochastic tree languages from a sample of...
International audienceRecently, an algorithm, DEES, was proposed for learning rational stochastic tr...
It is shown that a language is recursively enumerable if and only if it is a homomorphic image of a ...
AbstractThe theory of finite automata and coding has been linked to probability theory since its fou...
Some properties of languages representable in finite probabilistic automata are investigated. It is ...
International audienceIt is well known that, under some aperiodicity and irreducibility conditions, ...
The purpose of the paper is to prove that the family of languages accepted by finite probabilistic a...
In this work we study some probabilistic models for the random generation of words over a given alph...
We study the connections between rational series with coefficients in a semiring and their languages...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
The notion of a multistochastic automaton is defined. Several language families are obtained and inv...
Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpo...
L’apprentissage de modèles stochastiques générant des séquences a de nombreuses applications en trai...