On probabilistic analog automata

Theoretical Computer Science

Volumn 320, Issue 2-3, 2004, Pages 449-464

  Ben Hur, Asa ^a   Roitershtein, Alexander ^b   Siegelmann, Hava T ^c  

^a STANFORD UNIVERSITY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c The Manning College of Information and Computer Sciences   (United States)

Author keywords

Definite languages; Markov operators; Noisy computational systems; Probabilistic automata; Probabilistic computation; Regular languages

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FORMAL LANGUAGES; MARKOV PROCESSES; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBABILISTIC LOGICS; THEOREM PROVING;

DEFINITE LANGUAGES; MARKOV OPERATORS; NOISY COMPUTATIONAL SYSTEMS; PROBABILISTIC AUTOMATA; PROBABILISTIC COMPUTATION;

AUTOMATA THEORY;

EID: 2442685897     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.03.003     Document Type: Article

References (25)

1. Banaś J., Goebel K. Measures of Noncompactness in Banach Spaces. 1980;Marcel Dekker, New York.
2. Casey M. The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction. Neural Comput. 8:1996;1135-1178.
3. Cohen L.W., Dunford N. Transformations on sequence spaces. Duke. Math. J. 3:1937;689-701.
4. Doob J.L. Stochastic Processes. 1953;Wiley, New York.
5. Dunford N., Schwartz J.T. Linear Operators. Part I. 1971;Wiley, New York.
6. Iosifescu M. On two recent papers on ergodicity in non-homogeneous Markov chains. Ann. Math. Statist. 43:1972;1732-1736.
7. Iosifescu M., Grigorescu S. Dependence with Complete Connections and its Applications. 1990;Cambridge University Press, Cambridge.
8. Iosifescu M., Theodorescu R. Random Processes and Learning. 1969;Springer, Berlin, Heidelberg.
9. S. Kantorovitz, Introduction to Modern Analysis, in: Oxford Graduate Texts in Mathematics, Oxford University Press, Oxford, 2003.
10. Kechris A.S. Classical Descriptive Set Theory. Graduate Texts in Mathematics. Vol. 156:1995;Springer, New York.
11. S.C. Kleene, Representation of events in nerve nets and finite automata, in: C.E. Shannon, J. McCarty (Eds.), Automata Studies, Annals of Mathematics Studies, Vol. 34, Princeton University Press, Princeton, NJ, 1956, pp. 3-41.
12. Maass W., Orponen P. On the effect of analog noise in discrete time analog computations. Neural Comput. 10:1998;1071-1095.
13. Maass W., Sontag E. Analog neural nets with Gaussian or other common noise distribution cannot recognize arbitrary regular languages. Neural Comput. 11:1999;771-782.
14. Meyn S.P., Tweedie R. Markov Chains and Stochastic Stability. 1993;Springer, New York.
15. Neveu J. Mathematical Foundations of the Calculus of Probability. 1964;Holden Day, San Francisco.
16. Orey S. Limit Theorems for Markov Chain Transition Probabilities. 1971;Van Nostrand Reinhold, London.
17. Paz A. Ergodic theorems for infinite probabilistic tables. Ann. Math. Statist. 41:1970;539-550.
18. Paz A. Introduction to Probabilistic Automata. 1971;Academic Press, London.
19. Perles M., Rabin M., Shamir E. The theory of definite automata. IEEE Trans. EC-12:1963;233-243.
20. Rabin M. Probabilistic automata. Inform. Control. 3:1963;230-245.
21. Rabin M., Scott D. Finite automata and their decision problems. Moore E.F. Sequential Machines. 1964;Addison-Wesley, Reading, MA.
22. Siegelmann H.T. Neural Networks and Analog Computation: Beyond the Turing Limit. 1999;Birkhauser, Boston.
23. H.T. Siegelmann, A. Roitershtein, A. Ben-Hur, Noisy neural networks and generalizations, Proc. Ann. Conf. Neural Information Systems 1999 (NIPS*99), MIT Press, Cambridge, MA, 2000.
24. Siegelmann H.T., Sontag E.D. Analog computation via neural networks. JCSS. 50:1995;132-150.
25. Yosida K., Kakutani S. Operator-theoretical treatment of Markofff's process and mean ergodic theorem. Ann. Math. 42:1941;188-228.