Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Robust Implementation of Finite Automata by Recurrent RBF Networks
| |
|
32. Robust Implementation of Finite Automata by Recurrent RBF Networks
Michal Šorel7 and Jiří Šíma8, 9 
| (7) |
Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic, Pod vodárenskou věží 4, 182 07 Prague 8, Czech Republic |
| (8) |
Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod vodárenskou věží 2, 182 07 Prague 8, Czech Republic |
| (9) |
Institute for Theoretical Computer Science (ITI), Charles University, Prague, Czech Republic |
Abstract
In this paper a recurrent network, which consists of O(√m log m) RBF (radial basis functions)units with maximum norm employing any activation function that has different values in at least
two nonnegative points, is constructed so as to implement a given deterministic finite automaton with m states the underlying simulation proves to be robust with respect to analog noise for a large class of smooth activation
functions with a special type of inflexion.
Research supported by GA AS CR Grant B2030007.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|