Dynamical Recognizers: Real-Time Language Recognition by Analog Computers
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Joel I. Seiferas,et al. New Real-Time Simulations of Multihead Tape Units , 1981, J. ACM.
[3] Janet Wiles,et al. Learning to count without a counter: A case study of dynamics and activation landscapes in recurrent networks , 1995 .
[4] P. Holmes,et al. Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields , 1983, Applied Mathematical Sciences.
[5] C. Moore. Generalized one-sided shifts and maps of the interval , 1991 .
[6] S. Smale,et al. On a theory of computation and complexity over the real numbers; np-completeness , 1989 .
[7] Cristopher Moore,et al. Generalized shifts: unpredictability and undecidability in dynamical systems , 1991 .
[8] Michel Cosnard,et al. Computability Properties of Low-dimensional Dynamical Systems , 1993, STACS.
[9] Cristopher Moore,et al. Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines , 1999, Theor. Comput. Sci..
[10] C. Moore,et al. Closed-form Analytic Maps in One and Two DimensionsCan Simulate Turing Machines , 1996 .
[11] S. Smale,et al. On a theory of computation and complexity over the real numbers; np-completeness , 1989 .
[12] Bruno Courcelle,et al. The Rational Index: A Complexity Measure for Languages , 1981, SIAM J. Comput..
[13] Arnold L. Rosenberg,et al. Real-Time Definable Languages , 1967, JACM.
[14] Michel Cosnard,et al. Computability with Low-Dimensional Dynamical Systems , 1994, Theor. Comput. Sci..
[15] M. W. Shields. An Introduction to Automata Theory , 1988 .
[16] Pascal Koiran. Computing over the Reals with Addition and Order , 1994, Theor. Comput. Sci..
[17] Hava T. Siegelmann,et al. Analog computation via neural networks , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[18] Klaus Meer. Real Number Models under Various Sets of Operations , 1993, J. Complex..
[19] Jeffrey L. Elman,et al. Language as a dynamical system , 1996 .
[20] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[21] Alessandra Cherubini,et al. QRT FIFO Automata, Breath-First Grammars and Their Relations , 1991, Theor. Comput. Sci..
[22] Dima Grigoriev,et al. On the Power of Real Turing Machines Over Binary Inputs , 1997, SIAM J. Comput..
[23] Moore,et al. Unpredictability and undecidability in dynamical systems. , 1990, Physical review letters.
[24] Pascal Koiran. A weak version of the Blum, Shub and Smale model , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[25] H. Warren. Lower bounds for approximation by nonlinear manifolds , 1968 .
[26] Klaus Meer,et al. Descriptive complexity theory over the real numbers , 1995, STOC '95.
[27] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.
[28] Franz-Josef Brandenburg,et al. Intersections of Some Families of Languages , 1986, ICALP.
[29] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[30] T. Gelder,et al. Mind as Motion: Explorations in the Dynamics of Cognition , 1995 .
[31] Mike Casey,et al. The Dynamics of Discrete-Time Computation, with Application to Recurrent Neural Networks and Finite State Machine Extraction , 1996, Neural Computation.
[32] Joel I. Seiferas,et al. New Real-Time Simulations of Multihead Tape Units , 1977, JACM.
[33] Mark Steijvers,et al. A Recurrent Network that performs a Context-Sensitive Prediction Task , 1996 .