Publication details
Robust Implementation of Finite Automata by Recurrent RBF Networks
Conference Paper (international conference)
serial: SOFSEM'2000: Theory and Practice of Informatics, p. 431-439 , Eds: Hlaváč V., Jeffery K.G., Wiedermann J.
publisher: Springer, (Berlin 2000)
edition:
action: SOFSEM'2000 /27./, (Milovy, CZ, 25.11.2000-01.12.2000)
research: AV0Z1030915
project(s): IAB2030007GA AV ČR
abstract (eng):
In this paper a recurrent network, which consists of O(sqrt(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.
Cosati: 12, 06D
RIV: BA