The purpose of the paper is to prove that the family of languages accepted by finite probabilistic automata is not closed under any of the operations catenation, catenation closure and homomorphism
We consider the value 1 problem for probabilistic automata over finite words: it asks whether a give...
AbstractThis paper presents the theoretical underpinning of a model for symbolically representing pr...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
Some properties of languages representable in finite probabilistic automata are investigated. It is ...
The purpose of the paper is to prove that the family of languages accepted by finite probabilistic a...
We introduced in Turakainen (1973) several families of multistochastic languages which are closely r...
The notion of a multistochastic automaton is defined. Several language families are obtained and inv...
It is shown that a language is recursively enumerable if and only if it is a homomorphic image of a ...
A linear context-free language which is not acceptable by a finite probabilistic automaton is given,...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
The paper deals with generalized stochastic automata (probabilistic sequential machines) which are a...
The purpose of the paper is to give a necessary and sufficient condition for a certain type of m-adi...
Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpo...
International audienceIn probabilistic grammatical inference, a usual goal is to infer a good approx...
35 pagesThe goal of the present paper is to provide a systematic and comprehensive study of rational...
We consider the value 1 problem for probabilistic automata over finite words: it asks whether a give...
AbstractThis paper presents the theoretical underpinning of a model for symbolically representing pr...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
Some properties of languages representable in finite probabilistic automata are investigated. It is ...
The purpose of the paper is to prove that the family of languages accepted by finite probabilistic a...
We introduced in Turakainen (1973) several families of multistochastic languages which are closely r...
The notion of a multistochastic automaton is defined. Several language families are obtained and inv...
It is shown that a language is recursively enumerable if and only if it is a homomorphic image of a ...
A linear context-free language which is not acceptable by a finite probabilistic automaton is given,...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
The paper deals with generalized stochastic automata (probabilistic sequential machines) which are a...
The purpose of the paper is to give a necessary and sufficient condition for a certain type of m-adi...
Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpo...
International audienceIn probabilistic grammatical inference, a usual goal is to infer a good approx...
35 pagesThe goal of the present paper is to provide a systematic and comprehensive study of rational...
We consider the value 1 problem for probabilistic automata over finite words: it asks whether a give...
AbstractThis paper presents the theoretical underpinning of a model for symbolically representing pr...
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. W...
DOI
Add to ORKG