Graded State Machines: The Representation of Temporal Contingencies in Simple Recurrent Networks

Cite

Text

Servan-Schreiber et al. "Graded State Machines: The Representation of Temporal Contingencies in Simple Recurrent Networks." Machine Learning, 1991. doi:10.1007/BF00114843

Markdown

[Servan-Schreiber et al. "Graded State Machines: The Representation of Temporal Contingencies in Simple Recurrent Networks." Machine Learning, 1991.](https://mlanthology.org/mlj/1991/servanschreiber1991mlj-graded/) doi:10.1007/BF00114843

BibTeX

@article{servanschreiber1991mlj-graded,
  title     = {{Graded State Machines: The Representation of Temporal Contingencies in Simple Recurrent Networks}},
  author    = {Servan-Schreiber, David and Cleeremans, Axel and McClelland, James L.},
  journal   = {Machine Learning},
  year      = {1991},
  pages     = {161-193},
  doi       = {10.1007/BF00114843},
  volume    = {7},
  url       = {https://mlanthology.org/mlj/1991/servanschreiber1991mlj-graded/}
}