The complexity of language recognition by neural networks
暂无分享,去创建一个
[1] Hava T. Siegelmann,et al. On the power of sigmoid neural networks , 1993, COLT '93.
[2] C. Lee Giles,et al. Constructing deterministic finite-state automata in recurrent neural networks , 1996, JACM.
[3] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.
[4] Eduardo D. Sontag. On Some Questions of Rationality and Decidability , 1975, J. Comput. Syst. Sci..
[5] C. Lee Giles,et al. Learning and Extracting Finite State Automata with Second-Order Recurrent Neural Networks , 1992, Neural Computation.
[6] Don R. Hush,et al. Bounds on the complexity of recurrent neural network implementations of finite state machines , 1993, Neural Networks.
[7] Marcel Paul Schützenberger,et al. On the Definition of a Family of Automata , 1961, Inf. Control..
[8] Noga Alon,et al. Efficient simulation of finite automata by neural nets , 1991, JACM.
[9] Eduardo Sontag. Controllability is harder to decide than accessibility , 1988 .
[10] Eduardo Sontag,et al. Turing computability with neural nets , 1991 .
[11] Eduardo D. Sontag,et al. Realization Theory of Discrete-Time Nonlinear Systems: Part I - The Bounded Case , 1979 .
[12] Arto Salomaa,et al. Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.
[13] Eduardo D. Sontag,et al. Mathematical Control Theory: Deterministic Finite Dimensional Systems , 1990 .