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.
My Menu
Saved Items

32. Robust Implementation of Finite Automata by Recurrent RBF Networks

Michal ŠorelContact Information and Jiří Šíma8, 9 Contact Information

(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.

Contact Information Michal Šorel
Email: michal.sorel@centrum.cz

Contact Information Jiří Šíma
Email: sima@cs.cas.cz
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.106 • Server: mpweb16
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)