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.
論文 | ランダム
- High-Temperature Superconducting Meander Line Resonators with YBa_2Cu_3O_ Films
- 日米における水道水質管理の現状と今後の方向--日米水道水質管理及び下水道技術に関する政府間会議の記録
- 独立行政法人の憲法学 : 資料・独立行政法人一覧付
- 博物館法「改正」の問題点と背景(第1回)
- 書評 深沢克己著『商人と更紗--近世フランス=レヴァント貿易史研究』