Theory of Minimizing Linear Separation Automata
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we theoretically analyze a certain extension of a finite automaton, called a linear separation automaton (LSA). An LSA accepts a sequence of real vectors, and has a weight function and a threshold sequence at every state, which determine the transition from some state to another at each step. Transitions of LSAs are just corresponding to the behavior of perceptrons. We develop the theory of minimizing LSAs by using Myhill-Nerode theorem for LSAs. Its proof is performed as in the proof of the theorem for finite automata. Therefore we find that the extension to an LSA from the original finite automaton is theoretically natural.
論文 | ランダム
- 災害史シリ-ズ--気象災害史(82)新潟・加治川などが決壊,穀倉に濁流
- 災害史シリ-ズ 気象災害史(81)「昭和の三大台風」の秘話
- 災害史シリ-ズ 気象災害史(80)「昭和の三大台風」の秘話
- 災害史シリ-ズ気象災害史(79)台風,秋雨前線を刺激し1,000ミリの豪雨を降らす
- 災害史シリ-ズ 気象災害史(78)猛台風,伊豆地方と首都圏を直撃す