We introduced in Turakainen (1973) several families of multistochastic languages which are closely related to the homomorphic images of stochastic languages and to asynchronous stochastic sequential machines. This paper has two goals. One is to establish some new results on these language families and stochastic sequential transducers, and the other is to restate the main results of Turakainen (1973) by using a different approach based on some ideas of Ginsburg et al. (1969) concerning the interdependence of AFL operations
AbstractThis paper can be thought of as a companion paper to Van Loan's The Ubiquitous Kronecker Pro...
This paper examines numerical issues in computing solutions to networks of stochastic automata. It i...
This paper can be thought of as a companion paper to Van Loan's The Ubiquitous Kronecker Produc...
The notion of a multistochastic automaton is defined. Several language families are obtained and inv...
We introduced in Turakainen (1973) several families of multistochastic languages which are closely r...
The purpose of the paper is to prove that the family of languages accepted by finite probabilistic a...
It is shown that a language is recursively enumerable if and only if it is a homomorphic image of a ...
The paper deals with generalized stochastic automata (probabilistic sequential machines) which are a...
Some properties of languages representable in finite probabilistic automata are investigated. It is ...
This article presents a global overview of recent results concerning stochastic automata networks. A...
35 pagesThe goal of the present paper is to provide a systematic and comprehensive study of rational...
A deterministic (probabilistic) automaton is said to be in TC0 whenever its transitions (stochastic ...
The purpose of the paper is to give a necessary and sufficient condition for a certain type of m-adi...
Congruences for stochastic automata are defined, the corresponding factor automata are constructed a...
AbstractBoundary points between decidability and undecidability of various decision questions concer...
AbstractThis paper can be thought of as a companion paper to Van Loan's The Ubiquitous Kronecker Pro...
This paper examines numerical issues in computing solutions to networks of stochastic automata. It i...
This paper can be thought of as a companion paper to Van Loan's The Ubiquitous Kronecker Produc...
The notion of a multistochastic automaton is defined. Several language families are obtained and inv...
We introduced in Turakainen (1973) several families of multistochastic languages which are closely r...
The purpose of the paper is to prove that the family of languages accepted by finite probabilistic a...
It is shown that a language is recursively enumerable if and only if it is a homomorphic image of a ...
The paper deals with generalized stochastic automata (probabilistic sequential machines) which are a...
Some properties of languages representable in finite probabilistic automata are investigated. It is ...
This article presents a global overview of recent results concerning stochastic automata networks. A...
35 pagesThe goal of the present paper is to provide a systematic and comprehensive study of rational...
A deterministic (probabilistic) automaton is said to be in TC0 whenever its transitions (stochastic ...
The purpose of the paper is to give a necessary and sufficient condition for a certain type of m-adi...
Congruences for stochastic automata are defined, the corresponding factor automata are constructed a...
AbstractBoundary points between decidability and undecidability of various decision questions concer...
AbstractThis paper can be thought of as a companion paper to Van Loan's The Ubiquitous Kronecker Pro...
This paper examines numerical issues in computing solutions to networks of stochastic automata. It i...
This paper can be thought of as a companion paper to Van Loan's The Ubiquitous Kronecker Produc...