M. O. Rabin. Lectures on classical and probabilistic automata. In E. R. Caianiello, editor, Automata Theory. Academic Press, 1966. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Undecidability of Probabilistic Planning and.. - Madani, Hanks, Condon (2003) (2 citations) (Correct)
....result applies more widely, however, to a variety of problems in stochastic planning and control. For example, the result can be extended to resolve an open problem posed in [40] regarding the undecidability of in nite horizon POMDPs and a problem about PFAs called the threshold isolation problem [44,41]. Figure 1 depicts the problems analyzed in this paper. In the gure, the problems in bold rectangles are those established as undecidable in this paper. The oval is the existing result, and the rounded rectangles represent problems with well studied complexity results discussed to put our ....
....is positive, then we can presumably compute the regular language accepted by the PFA, and see whether it is empty or not. That would a ord at least the opportunity to recognize and solve a special case of the general emptiness problem. The decidability of the isolation problem was raised by Rabin [44] (see also Paz [41] page 163) and was later shown undecidable by Bertoni [4,5] by a reduction from Post s correspondence problem. The reduction in [15] also shows that recognizing an isolated threshold is undecidable: Corollary 3.6 The threshold isolation problem is undecidable. Proof. We can ....
M. O. Rabin. Lectures on classical and probabilistic automata. In E. R. Caianiello, editor, Automata Theory. Academic Press, 1966.
Foundations Of Recurrent Neural Networks - Siegelmann (1993) (4 citations) (Correct)
....until no change in its rank results after a few iterations. Remark 12.2.3 The gap between l complexity and H complexity can be arbitrarily large. This is easy to see from counting arguments. Indeed, there are an uncountable number of languages with l complexity equal to 2 see for instance [Rab66] page 311 but it is easy to see that there are only a countable number of languages with finite H complexity. 12.3 Different Activation Functions: Using The H Complexity As a Bound The space complexity using networks employing sigmoidal activation functions: oe(x) 1 1 e 0x ; is in a ....
M. Rabin. Lectures on classical and probabilistic automata. In E.R. Caianiello, editor, Automata Theory. Academic Press, London, 1966.
Undecidable Problems for Probabilistic Automata of Fixed.. - Blondel, Canterini (2001) (1 citation) (Correct)
No context found.
M. O. Rabin. Lectures on classical and probabilistic automata. In E. R. Caianiello, editor, Automata Theory, New York, 1966. Academic Press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC