1-2hit |
Junnosuke MORIYA Tetsuro NISHINO
In the filed of cognitive psychology, simple recurrent networks are used for modeling the natural language processing in the human brain. For example, Elman experimentally showed that the simple recurrent networks can predict the right-most word in sentential forms of a particular grammar which can generate compound sentences with high probability. Concerning these results, it is natural to ask whether the computational capability of the simple recurrent networks is sufficient to recognize natural languages. In this paper, we assume that the range of a function computed at each gate of a simple recurrent network is a finite set. This is a quite realistic assumption, because we cannot physically implement a gate whose range is an infinite set. Then, we define equivalence relations between simple recurrent networks and Mealy machines or Moore machines, which are finite automata with output. Then, under our assumption, we show (1) a construction of a Mealy machine which simulates a given simple recurrent network, and (2) a construction of a simple recurrent network which simulates a given Moore machine. From these two constructions, we can conclude that the computational capability of the simple recurrent networks is equal to that of finite automata with output under our assumption.
Koji WATANABE Takeo IKAI Kunio FUKUNAGA
Off-line state identification methods for a sequential machine using a homing sequence or an adaptive homing sequence (AHS) are well-known in the automata theory. There are, however, so far few studies on the subject of the on-line state estimator such as a state observer (SO) which is used in the linear system theory. In this paper, we shall construct such an SO for a Moore machine based on the state identification process by means of AHSs, and discuss the convergence property of the SO.