Fuzzy finite-state automata can be deterministically encoded into recurrent neural networks
نویسندگان
چکیده
منابع مشابه
Fuzzy finite-state automata can be deterministically encoded into recurrent neural networks
There has been an increased interest in combining fuzzy systems with neural networks because fuzzy neural systems merge the advantages of both paradigms. On the one hand, parameters in fuzzy systems have clear physical meanings and rule-based and linguistic information can be incorporated into adaptive fuzzy systems in a systematic way. On the other hand, there exist powerful algorithms for tra...
متن کاملInjecting Nondeterministic Finite State Automata into Recurrent Neural Networks
In this paper we propose a method for injecting time-warping nondeterministic nite state automata into recurrent neural networks. The proposed algorithm takes as input a set of automata transition rules and produces a recurrent architecture. The resulting connection weights are speciied by means of linear constraints. In this way, the network is guaranteed to carry out the assigned automata rul...
متن کاملRecurrent Neural Networks Learn Deterministic Representations of Fuzzy Finite-State Automata
The paradigm of deterministic nite-state automata (DFAs) and their corresponding regular languages have been shown to be very useful for addressing fundamental issues in recurrent neural networks. The issues that have been addressed include knowledge representation, extraction, and reenement as well development of advanced learning algorithms. Recurrent neural networks are also very promising t...
متن کاملFinite State Automata and Simple Recurrent Networks
We explore a network architecture introduced by Elman (1988) for predicting successive elements of a sequence. The network uses the pattern of activation over a set of hidden units from time-step t-1, together with element t, to predict element t + 1. When the network is trained with strings from a particular finite-state grammar, it can learn to be a perfect finite-state recognizer for the gra...
متن کاملRecurrent Neural Networks and Finite Automata
This article studies finite size networks that consist of interconnections of synchronously evolving processors. Each processor updates its state by applying an activation function lo a linear combination of the previous states of all units. We prove that any function for which the left and right limits exist and are different can be applied to the neurons to yield a network which is at least a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Fuzzy Systems
سال: 1998
ISSN: 1063-6706
DOI: 10.1109/91.660809