{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T02:26:56Z","timestamp":1761964016873},"reference-count":84,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Networks"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0893-6080(03)00054-6","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T18:45:52Z","timestamp":1053369952000},"page":"955-972","source":"Crossref","is-referenced-by-count":15,"title":["Incremental training of first order recurrent neural networks to predict a context-sensitive language"],"prefix":"10.1016","volume":"16","author":[{"given":"Stephan K.","family":"Chalup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan D.","family":"Blair","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0893-6080(03)00054-6_BIB1","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/72.265960","article-title":"An evolutionary algorithm that constructs recurrent neural networks","volume":"5","author":"Angeline","year":"1994","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB2","series-title":"The handbook of brain theory and neural networks","year":"1995"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB3","series-title":"Handbook of evolutionary computation","author":"Baeck","year":"1997"},{"issue":"2","key":"10.1016\/S0893-6080(03)00054-6_BIB4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/72.279181","article-title":"Learning long-term dependencies with gradient descent is difficult","volume":"5","author":"Bengio","year":"1994","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB5","series-title":"Natural computing series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04378-3","author":"Beyer","year":"2001"},{"issue":"55","key":"10.1016\/S0893-6080(03)00054-6_BIB6","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1162\/neco.1997.9.5.1127","article-title":"Analysis of dynamical recognizers","volume":"9","author":"Blair","year":"1997","journal-title":"Neural Computation"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB7","unstructured":"Bod\u00e9n, M., Jacobson, H., & Ziemke, T. (2000). Evolving context-free language predictors. In D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, & H. G. Beyer (Eds.). GECCO-2000: Proceedings of the Genetic and Evolutionary Computation Conference. A Joint Meeting of the Ninth International Conference on Genetic Algorithms (ICGA-2000) and the Fifth Annual Genetic Programming Conference (GP-2000), July 10\u201312, 2000, Las Vegas, Nevada. (pp. 1033\u20131040) San Francisco, CA: Morgan Kaufmann."},{"issue":"3,4","key":"10.1016\/S0893-6080(03)00054-6_BIB8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1080\/095400900750060122","article-title":"Context-free and context-sensitive dynamics in recurrent neural networks","volume":"12","author":"Bod\u00e9n","year":"2000","journal-title":"Connection Science"},{"issue":"2","key":"10.1016\/S0893-6080(03)00054-6_BIB9","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1109\/72.991436","article-title":"On learning context-free and context-sensitive languages","volume":"13","author":"Bod\u00e9n","year":"2001","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB10","doi-asserted-by":"crossref","unstructured":"Bod\u00e9n, M., Wiles, J., Tonkes, B., & Blair, A. (1999). Learning to predict a context-free language: Analysis of dynamics in recurrent hidden units. In Proceedings of the International Conference on Artificial Neural Networks (ICANN 99). (pp. 359\u2013364) Edinburgh: IEE.","DOI":"10.1049\/cp:19991135"},{"issue":"9","key":"10.1016\/S0893-6080(03)00054-6_BIB11","doi-asserted-by":"crossref","first-page":"2129","DOI":"10.1162\/089976600300015097","article-title":"Stable encoding of finite-state machines in discrete-time recurrent neural nets with sigmoid units","volume":"12","author":"Carrasco","year":"2000","journal-title":"Neural Computation"},{"issue":"6","key":"10.1016\/S0893-6080(03)00054-6_BIB12","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1162\/neco.1996.8.6.1135","article-title":"The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction","volume":"8","author":"Casey","year":"1996","journal-title":"Neural Computation"},{"issue":"6","key":"10.1016\/S0893-6080(03)00054-6_BIB15","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1142\/S0129065702001308","article-title":"Incremental learning in biological and machine learning systems","volume":"12","author":"Chalup","year":"2002","journal-title":"International Journal of Neural Systems"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB13","unstructured":"Chalup, S., & Blair, A. D. (1999). Hill climbing in recurrent neural networks for learning the anbncn language. In T. Gedeon et al. (Eds.), Proceedings of the Sixth International Conference on Neural Information Processing (ICONIP'99) (Vol. 2, pp. 508\u2013513)."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB14","doi-asserted-by":"crossref","unstructured":"Chalup, S., & Maire, F. (1999). A study on hill climbing for neural network training. Proceedings of the 1999 Congress on Evolutionary Computation (CEC'99) (pp. 2014\u20132021).","DOI":"10.1109\/CEC.1999.785522"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB16","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0019-9958(59)90362-6","article-title":"On certain formal properties of grammars","volume":"2","author":"Chomsky","year":"1959","journal-title":"Information and Control"},{"issue":"3","key":"10.1016\/S0893-6080(03)00054-6_BIB17","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1162\/neco.1989.1.3.372","article-title":"Finite state automata and simple recurrent networks","volume":"1","author":"Cleeremans","year":"1989","journal-title":"Neural Computation"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB18","first-page":"65","article-title":"Using prior knowledge in a NNPDA to learn context-free languages","volume":"5","author":"Das","year":"1993","journal-title":"Advances in Neural Information Processing Systems"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB19","doi-asserted-by":"crossref","unstructured":"Doya, K. (1992). Bifurcations in the learning of recurrent neural networks. Proceedings of 1992 IEEE International Symposium on Circuits and Systems (pp. 2777\u20132780).","DOI":"10.1109\/ISCAS.1992.230622"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB20","unstructured":"Doya, K. (1995). Recurrent networks: supervised learning. In Arbib (1995) (pp. 796\u2013800)."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB21","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1207\/s15516709cog1402_1","article-title":"Finding structure in time","volume":"14","author":"Elman","year":"1990","journal-title":"Cognitive Science"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB22","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00114844","article-title":"Distributes representations, simple recurrent networks, and grammatical structure","volume":"7","author":"Elman","year":"1991","journal-title":"Machine Learning"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB23","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0010-0277(93)90058-4","article-title":"Learning and development in neural networks: the importance of starting small","volume":"48","author":"Elman","year":"1993","journal-title":"Cognition"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB24","unstructured":"Finn, G. D. (1998). A recurrent neural network for the language anbn: Encoding and decoding binary strings in a neuron's activation function. Technical report, Machine Learning Research Centre, School of Computing Science, FIT, Queensland University of Technology, unpublished."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB25","series-title":"Tree adjoining grammars: Formalisms, linguistic analysis and processing","first-page":"101","article-title":"From regular to context-free to mildly context-sensitive tree rewriting systems: The path of child language acquisition","author":"Frank","year":"2000"},{"issue":"6","key":"10.1016\/S0893-6080(03)00054-6_BIB26","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1109\/72.963769","article-title":"LSTM recurrent networks learn simple context-free and context-sensitive languages","volume":"12","author":"Gers","year":"2001","journal-title":"IEEE Transactions On Neural Networks"},{"issue":"3","key":"10.1016\/S0893-6080(03)00054-6_BIB28","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1162\/neco.1992.4.3.393","article-title":"Learning and extracting finite state automata with second-order recurrent neural networks","volume":"4","author":"Giles","year":"1992","journal-title":"Neural Computation"},{"issue":"3","key":"10.1016\/S0893-6080(03)00054-6_BIB29","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1109\/72.668898","article-title":"Inductive inference from noisy examples using the hybrid finite state filter","volume":"9","author":"Gori","year":"1998","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB30","series-title":"Neural networks. A comprehensive foundation","author":"Haykin","year":"1999"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB31","series-title":"Introduction to the theory of neural computation","author":"Hertz","year":"1991"},{"issue":"1","key":"10.1016\/S0893-6080(03)00054-6_BIB32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1984-15236-4","article-title":"The dynamical systems approach to differential equations","volume":"11","author":"Hirsch","year":"1984","journal-title":"Bulletin (New Series) of the American Mathematical Society"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB33","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0893-6080(89)90018-X","article-title":"Convergent activation dynamics in continuous time networks","volume":"2","author":"Hirsch","year":"1989","journal-title":"Neural Networks"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB34","unstructured":"Hirsch, M. W. (1991). Network dynamics: Principles and problems. In Pasemann, F., & Doebner, H.-D. (Eds.). Neurodynamics: Proceedings of the Ninth Summer Workshop on Mathematical Physics, 1990. Vol. 1 of Series on Neural Networks. Singapore: World Scientific (pp. 3\u201329)."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB35","unstructured":"H\u00f6lldobler, S., Kalinke, Y., & Lehmann, H. (1997). Designing a counter: Another case study of dynamics and activation landscapes in recurrent networks. Proceedings of 21st German Conference on Artificial Intelligence. LNAI 1301. (pp. 313\u2013324) Berlin: Springer."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB36","series-title":"Introduction to automata theory, languages and computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB37","first-page":"865","article-title":"An attempt to define a class of mildly context-sensitive languages","volume":"54","author":"Ilie","year":"1999","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB38","doi-asserted-by":"crossref","unstructured":"Joshi, A. K., & Schabes, Y. (1997). Tree-adjoining grammars. Vol. 3 of (Eds.). (). , : (pp. 69\u2013123).","DOI":"10.1007\/978-3-642-59126-6_2"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB39","unstructured":"Joshi, A. K., Vijay-Shanker, K., & Weir, D. (1991). The convergence of mildly context-sensitive grammatical formalisms. In (Eds.). . : (pp. 31\u201381)."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB40","unstructured":"Kirby, S., & Hurford, J. R. (1997). The evolution of incremental learning: Language, development and critical periods. Technical report, Language Evolution and Computation Research Unit, University of Edinburgh."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB41","unstructured":"Kolen, J. F. (1994). Recurrent networks: State machines or iterated function systems? In M. C. Mozer, P. Smolensky, D. S. Touretzky , & J. L.Elman (Eds.), Proceedings of the 1993 Connectionist Models Summer School, Hillsdale, NJ: Erlbaum Associates (pp. 203\u2013210)."},{"issue":"4","key":"10.1016\/S0893-6080(03)00054-6_BIB43","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/72.392262","article-title":"On the computational power of Elman-style recurrent networks","volume":"6","author":"Kremer","year":"1995","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"2","key":"10.1016\/S0893-6080(03)00054-6_BIB44","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/72.750574","article-title":"Identification of a specific limitation on local-feedback recurrent networks acting as Mealy\/Moore machines","volume":"10","author":"Kremer","year":"1999","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB45","series-title":"Proceedings of the Neural Information Processing Systems 1996","author":"Maass","year":"1997"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB46","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1162\/089976698300017359","article-title":"On the effect of analog noise in discrete-time analog computations","volume":"10","author":"Maass","year":"1998","journal-title":"Neural Computation"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB47","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1162\/089976699300016656","article-title":"Analog neural nets with Gaussian or other common noise distribution cannot recognize arbitrary regular languages","volume":"11","author":"Maass","year":"1999","journal-title":"Neural Computation"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB48","series-title":"Advances in Neural Information Processing Systems (NIPS'99)","volume":"Vol. 11","author":"Maass","year":"1999"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB49","unstructured":"Martin-Vide, C., Mateescu, A., & Salomaa, A. (1999). Sewing contexts and mildly context-sensitive languages. TUCS Technical Report 257, Turku Centre for Computer Science."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB50","doi-asserted-by":"crossref","unstructured":"Melnik, O., Levy, S., & Pollack, J. B. (2000). RAAM for infinite context-free languages. International Joint Conference on Neural Networks (IJCNN'2000) (Vol. 5) IEEE Press.","DOI":"10.1109\/IJCNN.2000.861532"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB51","series-title":"Computation: Finite and infinite machines","author":"Minsky","year":"1967"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB52","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0304-3975(97)00028-5","article-title":"Dynamical recognizers: Real-time language recognition by analog computers","volume":"201","author":"Moore","year":"1998","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB54","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1162\/neco.1989.1.2.263","article-title":"Learning state-space trajectories in recurrent neural networks","volume":"1","author":"Pearlmutter","year":"1989","journal-title":"Neural Computation"},{"issue":"6","key":"10.1016\/S0893-6080(03)00054-6_BIB55","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1109\/72.410363","article-title":"Gradient calculations for dynamic recurrent neural networks: a survey","volume":"5","author":"Pearlmutter","year":"1995","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB56","unstructured":"Pollack, J., (1987). On connectionist models of natural language processing. PhD thesis, Computer Science Department, University of Illinois, Urbana, IL."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB57","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00114845","article-title":"The induction of dynamical recognizers","volume":"7","author":"Pollack","year":"1991","journal-title":"Machine Learning"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB58","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1023\/A:1007417214905","article-title":"Co-evolution in the successful learning of backgammon strategy","volume":"32","author":"Pollack","year":"1998","journal-title":"Machine Learning"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB60","unstructured":"Rechenberg, I. (1965). Cybernetic solution path of an experimental problem. Technical report, Royal Aircraft Establishment, Library Translation No. 1122."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB61","unstructured":"Rechenberg, I. (1994). Evolutionsstrategie '94. Stuttgart: Frommann-Holzboog."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB62","series-title":"Neural information processing systems","article-title":"Static and dynamic error propagation networks with applications to speech coding","author":"Robinson","year":"1988"},{"issue":"9","key":"10.1016\/S0893-6080(03)00054-6_BIB63","doi-asserted-by":"crossref","first-page":"2093","DOI":"10.1162\/089976601750399326","article-title":"Simple recurrents networks learn context-free and context-sensitive languages by counting","volume":"13","author":"Rodriguez","year":"2001","journal-title":"Neural Computation"},{"issue":"1","key":"10.1016\/S0893-6080(03)00054-6_BIB64","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1080\/095400999116340","article-title":"A recurrent neural network that learns to count","volume":"11","author":"Rodriguez","year":"1999","journal-title":"Connection Science"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB65","unstructured":"Rohde, D. L. T., & Plaut, D. C. (1997). Simple recurrent networks and natural language: How important is starting small? In Proceedings of the 19th Annual Conference of the Cognitive Science Society."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB66","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0010-0277(99)00031-1","article-title":"Language acquisition in the absence of explicit negative evidence: How important is starting small?","volume":"72","author":"Rohde","year":"1999","journal-title":"Cognition"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB67","unstructured":"Rohde, D. L. T., & Plaut, D. C. (2003). Less is less in language acquisition. In (Ed.). . : ."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB69","doi-asserted-by":"crossref","unstructured":"Rudolph, G (1997). Evolution strategies. In Baeck, Fogel, Michalewicz, & Pidgeon (1997) (pp. B1.3:1\u20136).","DOI":"10.1887\/0750308958\/b386c9"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB70","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1038\/323533a0","article-title":"Learning representations by back-propagating errors","author":"Rumelhart","year":"1986","journal-title":"Nature"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB71","unstructured":"Schwefel, H.-P. (1965). Kybernetische Evolution als Strategie der experimentellen Forschung in der Str\u00f6mungsmechanik. Master's thesis, Technische Universit\u00e4t Berlin, Hermann F\u00f6ttinger Institut fuer Hydrodynamik."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB72","series-title":"Evolution and optimum seeking","author":"Schwefel","year":"1995"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB74","series-title":"Progress in theoretical computer science","author":"Siegelmann","year":"1999"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB75","unstructured":"Sontag, E. (1995). Automata and neural networks. In Arbib (1995) (pp. 119\u2013123)."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB76","unstructured":"Steijvers, M., & Gr\u00fcnwald, P. (1996). A recurrent network that performs a context-sensitive prediction task. Proceedings of the 18th Annual Conference of the Cognitive Science Society. (pp. 335\u2013339) Los Altos: Morgan Kauffman."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB77","unstructured":"Sun, G. Z., Chen, H. H., Giles, C. L., Lee, Y. C., & Chen, D. (1991). Neural networks with external memeory stack that learn context-free grammars from examples. In Proceedings of the Conference on Information Science and Systems. (pp. 649\u2013653) Princeton University."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB78","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1162\/08997660152002898","article-title":"Attractive periodic sets in discrete-time recurrent networks (with emphasis on fixed-point stability and bifurcations in two-neuron networks)","volume":"13","author":"Tino","year":"2001","journal-title":"Neural Computation"},{"issue":"4","key":"10.1016\/S0893-6080(03)00054-6_BIB79","doi-asserted-by":"crossref","DOI":"10.1162\/neco.1995.7.4.822","article-title":"Learning and extracting initial Mealy automata with a modular neural network model","volume":"7","author":"Tino","year":"1995","journal-title":"Neural Computation"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB80","unstructured":"Tonkes, B., Blair, A., & Wiles, J. (1998). Inductive bias in context-free language learning. In Proceedings of the Ninth Australian Conference on Neural Networks (ACNN'98), (pp. 52\u201356) Brisbane: University of Queensland."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB81","article-title":"Learning a context-free task with a recurrent neural network: An analysis of stability","author":"Tonkes","year":"1999"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB82","doi-asserted-by":"crossref","unstructured":"Touretzky, D. (Ed.) (1991). Connectionist approaches to language learning. The Kluwer International Series in Engineering and Computer Science. Dordecht: Kluwer (a special issue of machine learning on connectionist approaches to language learning).","DOI":"10.1007\/978-1-4615-4008-3"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB83","doi-asserted-by":"crossref","unstructured":"Tsoi, A. C. (1998). Recurrent neural network architectures: an overview. In (Eds.). . , : (pp. 1\u201326).","DOI":"10.1007\/BFb0053993"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB84","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0925-2312(97)00161-6","article-title":"Discrete time recurrent neural network architectures: a unifying review","volume":"15","author":"Tsoi","year":"1997","journal-title":"Neurocomputing"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB85","unstructured":"Werbos, P. J. (1974). Beyond regression: New tools for prediction and analysis in the behavioural sciences. PhD thesis, Harvard University, Cambridge, MA."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB86","unstructured":"Wiles, J., Blair, A. D., & Bod\u00e9n, M. (2001). Representation beyond finite states: Alternatives to push-down automata. In (Eds.). . : (pp. 129\u2013142)."},{"key":"10.1016\/S0893-6080(03)00054-6_BIB87","unstructured":"Wiles, J., & Elman, J. L. (1995). Learning to count without a counter: A case study of dynamics and activation landscapes in recurrent networks. Proceedings of the 17th Annual Conference of the Cognitive Science Society. (pp. 482\u2013487) Cambridge, MA: MIT Press."},{"issue":"3","key":"10.1016\/S0893-6080(03)00054-6_BIB88","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1109\/72.572107","article-title":"A new evolutionary system for evolving artificial neural networks","volume":"8","author":"Yao","year":"1997","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"2","key":"10.1016\/S0893-6080(03)00054-6_BIB89","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1109\/72.279194","article-title":"Discrete recurrent neural networks for grammatical inference","volume":"5","author":"Zeng","year":"1994","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/S0893-6080(03)00054-6_BIB90","series-title":"Advances in neural information processing systems","volume":"Vol. 2","author":"Zipser","year":"1990"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608003000546?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608003000546?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T09:29:58Z","timestamp":1553160598000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893608003000546"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":84,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0893608003000546"],"URL":"https:\/\/doi.org\/10.1016\/s0893-6080(03)00054-6","relation":{},"ISSN":["0893-6080"],"issn-type":[{"value":"0893-6080","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}