|
Volumn 2, Issue 470, 1999, Pages 673-677
|
Efficient encodings of finite automata in discrete-time recurrent neural networks
a a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
DISCRETE TIME CONTROL SYSTEMS;
ENCODING (SYMBOLS);
FINITE AUTOMATA;
SEQUENTIAL MACHINES;
DETERMINISTIC FINITE AUTOMATA (DFA);
DISCRETE TIME RECURRENT NEURAL NETWORKS (DTRNN);
FINITE STATE MACHINES (FSM);
NONDETERMINISTIC FINITE AUTOMATA (NFA);
RECURRENT NEURAL NETWORKS;
|
EID: 0032613810
PISSN: 05379989
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1049/cp:19991188 Document Type: Conference Paper |
Times cited : (6)
|
References (20)
|