Showing papers on "Relevance vector machine published in 1969"
TL;DR: By applying the algorithm for testing the linearity of a probabilistic sequential machine to the 2-adic automaton, it is shown that there are linear probabilism automata, which can accept non-regular events.
Abstract: Based on the notion of a stochastic matrix operator, the class of linear probabilistic sequential machines is defined and characterized. Necessary and sufficient conditions are formulated for a given probabilistic sequential machine to be linear. An algorithm for testing the linearity of a probabilistic sequential machine is presented as well. By applying this algorithm to the 2-adic automaton, it is shown that there are linear probabilistic automata, which can accept non-regular events.
3 citations