Abstract
We give a necessary condition that a simple recurrent neural network with two sigmoidal hidden units to implement a recognizer of the formal language {a n b n
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 436-445 |
| Number of pages | 10 |
| Volume | 4984 LNCS |
| Edition | PART 1 |
| DOIs | |
| Publication status | Published - 2008 |
| Event | 14th International Conference on Neural Information Processing, ICONIP 2007 - Kitakyushu, Japan Duration: 2007 Nov 13 → 2007 Nov 16 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Number | PART 1 |
| Volume | 4984 LNCS |
| ISSN (Print) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 14th International Conference on Neural Information Processing, ICONIP 2007 |
|---|---|
| Country | Japan |
| City | Kitakyushu |
| Period | 07/11/13 → 07/11/16 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
Cite this
A characterization of simple recurrent neural networks with two hidden units as a language recognizer. / Iwata, Azusa; Shinozawa, Yoshihisa; Sakurai, Akito.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4984 LNCS PART 1. ed. 2008. p. 436-445 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4984 LNCS, No. PART 1).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - A characterization of simple recurrent neural networks with two hidden units as a language recognizer
AU - Iwata, Azusa
AU - Shinozawa, Yoshihisa
AU - Sakurai, Akito
PY - 2008
Y1 - 2008
N2 - We give a necessary condition that a simple recurrent neural network with two sigmoidal hidden units to implement a recognizer of the formal language {a n b n
AB - We give a necessary condition that a simple recurrent neural network with two sigmoidal hidden units to implement a recognizer of the formal language {a n b n
UR - http://www.scopus.com/inward/record.url?scp=54249088081&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=54249088081&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-69158-7_46
DO - 10.1007/978-3-540-69158-7_46
M3 - Conference contribution
SN - 3540691545
SN - 9783540691549
VL - 4984 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 436
EP - 445
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -