Ústav teorie informace a automatizace

Jste zde

Bibliografie

Conference Paper (international conference)

Robust Implementation of Finite Automata by Recurrent RBF Networks

Šorel Michal, Šíma Jiří

: SOFSEM'2000: Theory and Practice of Informatics, p. 431-439 , Eds: Hlaváč V., Jeffery K.G., Wiedermann J.

: SOFSEM 2000 /27./, (Milovy, CZ, 25.11.2000-01.12.2000)

: AV0Z1030915

: IAB2030007, GA AV ČR

: 10.1007/3-540-44411-4_32

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

: 12, 06D

: BA

07.01.2019 - 08:39