State and Threshold Sequence Minimization Algorithm of Linear Separation Automata

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we present a minimization algorithm of the number of states of a linear separation automaton (LSA). An LSA is an extended model of a finite automaton. It accepts a sequence of real vectors, and has a weight and a threshold sequence at every state, which determine the transition from the current state to the next at each step. In our previous paper, we characterized an LSA and the minimum state LSA. The minimum state version for a given LSA M is obtained by the algorithm presented in this paper. Its time complexity is O((K + k)n2), where K is the maximum number of threshold values assigned to each weight, k is the maximum number of edges going out from a state of M, and n is the number of states in M. Moreover, we discuss the minimization of a threshold sequence at each state.

• 2010-10-25

著者

• Satoshi Kobayashi

  Department Of Computer Science Graduate School Of Electro-communications The University Of Electro-c

• Yuji Numai

  Department Of Computer Science Graduate School Of Electro-communications The University Of Electro-c

• Yoshiaki Udagawa

  NTT-IT Corporation

• Satoshi Kobayashi

  Department of Anatomy, Sinshu University School of Medicine

関連論文

• State and Threshold Sequence Minimization Algorithm of Linear Separation Automata
• Theory of Minimizing Linear Separation Automata
• The Usefulness and Limitations of Intravenous Digital Sub-tractionAngiography Screening in Detecting Unrup-tured Cerebral Aneurysmsand Methods to Improve its Reliability

スポンサーリンク