DocumentCode
275930
Title
Logical neural nets and distributed implementations of weighted regular languages
Author
Ludermir, T.B.
Author_Institution
King´´s Coll. London, UK
fYear
1991
fDate
18-20 Nov 1991
Firstpage
158
Lastpage
162
Abstract
A logical neural network, Aleksander (1), is a finite state machine then it is only possible to recognise regular grammars with these networks. When extra memory is associated with the nodes of these networks, the computational power of the model is increased and now weighted regular grammars, Salomaa (14), can be recognised. Through a constructive method based on the complexity of the production rules of the grammar, a logical network can be built to recognise any weighted regular language. The network generated by the constructive method is a distributed implementation of the weighted regular language
Keywords
finite automata; knowledge based systems; neural nets; probability; computational power; constructive method; finite state machine; logical neural network; production rules; weighted regular grammars; weighted regular language;
fLanguage
English
Publisher
iet
Conference_Titel
Artificial Neural Networks, 1991., Second International Conference on
Conference_Location
Bournemouth
Print_ISBN
0-85296-531-1
Type
conf
Filename
140307
Link To Document