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.
論文 | ランダム
- 都市賤民行政史の基礎考察--東京の被差別部落と「乞胸」部落の場合
- 書評 『都市再生の合意形成学』鹿島出版社、2008年12月 6+284ページ 宮崎洋司著
- プロジェクト紹介 大規模切土(急峻山裾部)の鉄道土工設計
- 温室効果ガス観測技術衛星"GOSAT" (特集 宇宙新時代へ)
- 宮崎洋司著『都市再生の合意形成学』鹿島出版会，2008年 284ページ