Recurrent neural networks can learn simple, approximate regular languages

Mikel L. Forcada, Antonio M. CorbĂ­-Bellot, Marco Gori, Marco Maggini. Recurrent neural networks can learn simple, approximate regular languages. In International Joint Conference Neural Networks, IJCNN 1999, Washington, DC, USA, July 10-16, 1999. pages 1527-1532, IEEE, 1999. [doi]

@inproceedings{ForcadaCGM99-0,
  title = {Recurrent neural networks can learn simple, approximate regular languages},
  author = {Mikel L. Forcada and Antonio M. CorbĂ­-Bellot and Marco Gori and Marco Maggini},
  year = {1999},
  doi = {10.1109/IJCNN.1999.832596},
  url = {https://doi.org/10.1109/IJCNN.1999.832596},
  researchr = {https://researchr.org/publication/ForcadaCGM99-0},
  cites = {0},
  citedby = {0},
  pages = {1527-1532},
  booktitle = {International Joint Conference Neural Networks, IJCNN 1999, Washington, DC, USA, July 10-16, 1999},
  publisher = {IEEE},
}