The purpose of the paper is to give a necessary and sufficient condition for a certain type of m-adic languages (as defined by Salomaa (1967)) to be non-regular. This solves a problem raised by Salomaa
Abstract. We consider probabilistic automata over finite words. Such an au-tomaton defines the langu...
It is shown that a language is recursively enumerable if and only if it is a homomorphic image of a ...
International audienceIn probabilistic grammatical inference, a usual goal is to infer a good approx...
The purpose of the paper is to give a necessary and sufficient condition for a certain type of m-adi...
A short proof of the result concerning the regularity of events defined by m-adic probabilistic auto...
The purpose of the paper is to prove that the family of languages accepted by finite probabilistic a...
Some properties of languages representable in finite probabilistic automata are investigated. It is ...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
Paz 1967defines ε-approximation of probabilistic finite acceptors (p.ac.) and proves that the class ...
35 pagesThe goal of the present paper is to provide a systematic and comprehensive study of rational...
It is shown that the language accepted by the m-adic two-state probabilistic acceptor at a given cut...
AbstractThis paper is a continuation of the work by Landweber [5], to clarify the relationship betwe...
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...
Weighted automata are nondeterministic automata with numerical weights on transitions. They can defi...
Abstract. We consider probabilistic automata over finite words. Such an au-tomaton defines the langu...
It is shown that a language is recursively enumerable if and only if it is a homomorphic image of a ...
International audienceIn probabilistic grammatical inference, a usual goal is to infer a good approx...
The purpose of the paper is to give a necessary and sufficient condition for a certain type of m-adi...
A short proof of the result concerning the regularity of events defined by m-adic probabilistic auto...
The purpose of the paper is to prove that the family of languages accepted by finite probabilistic a...
Some properties of languages representable in finite probabilistic automata are investigated. It is ...
In this paper the necessary and sufficient conditions of representability of nonregular languages in...
Paz 1967defines ε-approximation of probabilistic finite acceptors (p.ac.) and proves that the class ...
35 pagesThe goal of the present paper is to provide a systematic and comprehensive study of rational...
It is shown that the language accepted by the m-adic two-state probabilistic acceptor at a given cut...
AbstractThis paper is a continuation of the work by Landweber [5], to clarify the relationship betwe...
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...
Weighted automata are nondeterministic automata with numerical weights on transitions. They can defi...
Abstract. We consider probabilistic automata over finite words. Such an au-tomaton defines the langu...
It is shown that a language is recursively enumerable if and only if it is a homomorphic image of a ...
International audienceIn probabilistic grammatical inference, a usual goal is to infer a good approx...
DOI
Add to ORKG