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
