Servan-Schreiber,Cleeremans,McClelland -- Graded state machines: the representation of temporal contingencies in Simple Recurrent Networks -- 1989 | ||
| Google Web Search
:: Google Scholar | ||
| 2007 | - | Organization of the state space of a simple recurrent network before and after training on recursive linguistic structures - Cernansky,Makula,Benuskova |
| Servan-Schreiber, D., Cleeremans, A., & McClelland, J. L. (1989). Graded state machines: the representation of temporal contingencies in Simple Recurrent Networks. Machine Learning, 7, 161-193.
| ||
| 1994 | - | Infinite Languages, Finite Minds: Connectionism, Learning and Linguistic Structure - Christiansen |
| Servan-Schreiber, D., Cleeremans, A. & McClelland, J. L. (1991) Graded State Machines: The Representation of Temporal Contingencies in Simple Recurrent Networks. Machine Learning, 7, 161--193.
| ||
| 1999 | - | Toward a connectionist model of recursion in human linguistic performance - Christiansen,Chater |
| Servan-Schreiber, D., Cleeremans, A. & McClelland, J. L. (1991). Graded state machines: The representation of temporal contingencies in simple recurrent networks. Machine Learning, 7, 161--193.
| ||
| 1999 | - | Disambiguation and Grammar as Emergent Soft Constraints - Miikkulainen,Mayberry |
| Servan-Schreiber, D., Cleeremans, A., and McClelland, J. L. (1991). Graded state machines: The representation of temporal contingencies in simple recurrent networks. Machine Learning, 7:161--194.
| ||