Using Prior Knowledge in a {NNPDA} to Learn Context-Free Languages
暂无分享,去创建一个
[1] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[2] 守屋 悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .
[3] C. Lee Giles,et al. Higher Order Recurrent Networks and Grammatical Inference , 1989, NIPS.
[4] M. V. Rossum,et al. In Neural Computation , 2022 .
[5] Ronald J. Williams,et al. A Learning Algorithm for Continually Running Fully Recurrent Neural Networks , 1989, Neural Computation.
[6] Jude Shavlik,et al. Refinement ofApproximate Domain Theories by Knowledge-Based Neural Networks , 1990, AAAI.
[7] Yaser S. Abu-Mostafa,et al. Learning from hints in neural networks , 1990, J. Complex..
[8] Irving S. Reed,et al. Including Hints in Training Neural Nets , 1991, Neural Computation.
[9] C. Lee Giles,et al. Learning and Extracting Finite State Automata with Second-Order Recurrent Neural Networks , 1992, Neural Computation.
[10] C. Lee Giles,et al. Training Second-Order Recurrent Neural Networks using Hints , 1992, ML.