ML Anthology

Finite State Automata That Recurrent Cascade-Correlation Cannot Represent

Stefan C. Kremer
NeurIPS 1995 pp. 612-618
/neurips/1995/kremer1995neurips-finite/

Abstract

This paper relates the computational power of Fahlman' s Recurrent Cascade Correlation (RCC) architecture to that of fInite state automata (FSA). While some recurrent networks are FSA equivalent, RCC is not. The paper presents a theoretical analysis of the RCC architecture in the form of a proof describing a large class of FSA which cannot be realized by RCC.

PDF NeurIPS Semantic Scholar

Cite

Text

Kremer. "Finite State Automata That Recurrent Cascade-Correlation Cannot Represent." Neural Information Processing Systems, 1995.

Markdown

[Kremer. "Finite State Automata That Recurrent Cascade-Correlation Cannot Represent." Neural Information Processing Systems, 1995.](https://mlanthology.org/neurips/1995/kremer1995neurips-finite/)

BibTeX

@inproceedings{kremer1995neurips-finite,
  title     = {{Finite State Automata That Recurrent Cascade-Correlation Cannot Represent}},
  author    = {Kremer, Stefan C.},
  booktitle = {Neural Information Processing Systems},
  year      = {1995},
  pages     = {612-618},
  url       = {https://mlanthology.org/neurips/1995/kremer1995neurips-finite/}
}